/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:18:50,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:18:50,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:18:50,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:18:50,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:18:50,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:18:50,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:18:50,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:18:50,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:18:50,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:18:50,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:18:50,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:18:50,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:18:50,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:18:50,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:18:50,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:18:50,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:18:50,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:18:50,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:18:50,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:18:50,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:18:50,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:18:50,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:18:50,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:18:50,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:18:50,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:18:50,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:18:50,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:18:50,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:18:50,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:18:50,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:18:50,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:18:50,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:18:50,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:18:50,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:18:50,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:18:50,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:18:50,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:18:50,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:18:50,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:18:50,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:18:50,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:18:50,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:18:50,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:18:50,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:18:50,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:18:50,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:18:50,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:18:50,583 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:18:50,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:18:50,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:18:50,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:18:50,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:18:50,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:18:50,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:18:50,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:18:50,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:18:50,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:18:50,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:18:50,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:18:50,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:18:50,845 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:18:50,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-12-12 21:18:51,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:18:52,057 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:18:52,058 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-12-12 21:18:52,074 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8934878/7145d421b2a041b0ae3bc7f88bb81fb3/FLAG393ca5f33 [2022-12-12 21:18:52,084 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8934878/7145d421b2a041b0ae3bc7f88bb81fb3 [2022-12-12 21:18:52,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:18:52,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:18:52,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:18:52,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:18:52,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:18:52,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a259166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52, skipping insertion in model container [2022-12-12 21:18:52,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:18:52,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:18:52,631 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-12-12 21:18:52,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:18:52,668 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:18:52,701 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-12-12 21:18:52,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:18:52,755 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:18:52,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52 WrapperNode [2022-12-12 21:18:52,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:18:52,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:18:52,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:18:52,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:18:52,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,817 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2022-12-12 21:18:52,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:18:52,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:18:52,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:18:52,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:18:52,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:18:52,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:18:52,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:18:52,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:18:52,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (1/1) ... [2022-12-12 21:18:52,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:18:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:18:52,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:18:52,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:18:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 21:18:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 21:18:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 21:18:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 21:18:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:18:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:18:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 21:18:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:18:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 21:18:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:18:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:18:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:18:52,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:18:52,959 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:18:53,116 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:18:53,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:18:53,340 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:18:53,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:18:53,346 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 21:18:53,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:18:53 BoogieIcfgContainer [2022-12-12 21:18:53,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:18:53,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:18:53,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:18:53,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:18:53,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:18:52" (1/3) ... [2022-12-12 21:18:53,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171c9bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:18:53, skipping insertion in model container [2022-12-12 21:18:53,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:18:52" (2/3) ... [2022-12-12 21:18:53,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171c9bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:18:53, skipping insertion in model container [2022-12-12 21:18:53,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:18:53" (3/3) ... [2022-12-12 21:18:53,353 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-12-12 21:18:53,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:18:53,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:18:53,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:18:53,457 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 21:18:53,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 161 transitions, 338 flow [2022-12-12 21:18:53,555 INFO L130 PetriNetUnfolder]: 10/159 cut-off events. [2022-12-12 21:18:53,555 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 21:18:53,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 159 events. 10/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 374 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-12 21:18:53,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 161 transitions, 338 flow [2022-12-12 21:18:53,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 150 transitions, 309 flow [2022-12-12 21:18:53,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:18:53,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 150 transitions, 309 flow [2022-12-12 21:18:53,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 309 flow [2022-12-12 21:18:53,599 INFO L130 PetriNetUnfolder]: 10/150 cut-off events. [2022-12-12 21:18:53,600 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 21:18:53,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 150 events. 10/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 305 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-12 21:18:53,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 150 transitions, 309 flow [2022-12-12 21:18:53,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-12 21:18:58,920 INFO L241 LiptonReduction]: Total number of compositions: 130 [2022-12-12 21:18:58,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:18:58,949 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c7e1b87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:18:58,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:18:58,962 INFO L130 PetriNetUnfolder]: 1/53 cut-off events. [2022-12-12 21:18:58,962 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 21:18:58,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:18:58,963 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-12 21:18:58,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:18:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:18:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash -516154407, now seen corresponding path program 1 times [2022-12-12 21:18:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:18:58,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352279580] [2022-12-12 21:18:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:18:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:18:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:18:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:18:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:18:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352279580] [2022-12-12 21:18:59,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352279580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:18:59,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:18:59,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:18:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498203297] [2022-12-12 21:18:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:18:59,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:18:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:18:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:18:59,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:18:59,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:18:59,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:18:59,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:18:59,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:18:59,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:00,597 INFO L130 PetriNetUnfolder]: 16189/26750 cut-off events. [2022-12-12 21:19:00,597 INFO L131 PetriNetUnfolder]: For 260/260 co-relation queries the response was YES. [2022-12-12 21:19:00,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52421 conditions, 26750 events. 16189/26750 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 205627 event pairs, 5434 based on Foata normal form. 0/8343 useless extension candidates. Maximal degree in co-relation 51728. Up to 15194 conditions per place. [2022-12-12 21:19:00,679 INFO L137 encePairwiseOnDemand]: 92/117 looper letters, 169 selfloop transitions, 13 changer transitions 0/196 dead transitions. [2022-12-12 21:19:00,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 771 flow [2022-12-12 21:19:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:19:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:19:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-12-12 21:19:00,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6837606837606838 [2022-12-12 21:19:00,692 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-12-12 21:19:00,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 196 transitions, 771 flow [2022-12-12 21:19:00,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 196 transitions, 771 flow [2022-12-12 21:19:00,739 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 196 transitions, 771 flow [2022-12-12 21:19:00,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:00,739 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:00,739 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:00,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:19:00,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash -922607971, now seen corresponding path program 1 times [2022-12-12 21:19:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849418040] [2022-12-12 21:19:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:00,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:00,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849418040] [2022-12-12 21:19:00,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849418040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:00,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:00,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:19:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999435903] [2022-12-12 21:19:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:19:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:00,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:19:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:19:00,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 117 [2022-12-12 21:19:00,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 196 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:00,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:00,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 117 [2022-12-12 21:19:00,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:02,564 INFO L130 PetriNetUnfolder]: 17383/28538 cut-off events. [2022-12-12 21:19:02,564 INFO L131 PetriNetUnfolder]: For 565/565 co-relation queries the response was YES. [2022-12-12 21:19:02,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82985 conditions, 28538 events. 17383/28538 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 214385 event pairs, 4759 based on Foata normal form. 229/9602 useless extension candidates. Maximal degree in co-relation 81857. Up to 23284 conditions per place. [2022-12-12 21:19:02,635 INFO L137 encePairwiseOnDemand]: 99/117 looper letters, 209 selfloop transitions, 2 changer transitions 30/258 dead transitions. [2022-12-12 21:19:02,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 258 transitions, 1507 flow [2022-12-12 21:19:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:19:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:19:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2022-12-12 21:19:02,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2022-12-12 21:19:02,638 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2022-12-12 21:19:02,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 258 transitions, 1507 flow [2022-12-12 21:19:02,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 228 transitions, 1324 flow [2022-12-12 21:19:02,688 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 228 transitions, 1324 flow [2022-12-12 21:19:02,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:02,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:02,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:02,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:19:02,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1723619755, now seen corresponding path program 1 times [2022-12-12 21:19:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:02,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138039553] [2022-12-12 21:19:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138039553] [2022-12-12 21:19:02,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138039553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:02,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:02,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:19:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11337752] [2022-12-12 21:19:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:02,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:19:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:19:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:19:02,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:19:02,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 228 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:02,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:02,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:19:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:04,479 INFO L130 PetriNetUnfolder]: 17490/28358 cut-off events. [2022-12-12 21:19:04,480 INFO L131 PetriNetUnfolder]: For 1543/1549 co-relation queries the response was YES. [2022-12-12 21:19:04,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108320 conditions, 28358 events. 17490/28358 cut-off events. For 1543/1549 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 215821 event pairs, 3905 based on Foata normal form. 0/9861 useless extension candidates. Maximal degree in co-relation 107063. Up to 25509 conditions per place. [2022-12-12 21:19:04,569 INFO L137 encePairwiseOnDemand]: 110/117 looper letters, 286 selfloop transitions, 10 changer transitions 18/330 dead transitions. [2022-12-12 21:19:04,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 330 transitions, 2566 flow [2022-12-12 21:19:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:19:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:19:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2022-12-12 21:19:04,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5498575498575499 [2022-12-12 21:19:04,572 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2022-12-12 21:19:04,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 330 transitions, 2566 flow [2022-12-12 21:19:04,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 312 transitions, 2419 flow [2022-12-12 21:19:04,626 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 312 transitions, 2419 flow [2022-12-12 21:19:04,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:04,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:04,627 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:19:04,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1585944762, now seen corresponding path program 1 times [2022-12-12 21:19:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842904417] [2022-12-12 21:19:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:04,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:04,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842904417] [2022-12-12 21:19:04,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842904417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:19:04,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719529281] [2022-12-12 21:19:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:04,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:19:04,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:19:04,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:19:04,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 21:19:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:04,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-12 21:19:04,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:19:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:04,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:19:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719529281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:19:04,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:19:04,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-12 21:19:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068856033] [2022-12-12 21:19:04,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:19:04,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:19:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:19:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:19:04,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:19:04,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 312 transitions, 2419 flow. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:04,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:04,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:19:04,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:09,354 INFO L130 PetriNetUnfolder]: 36047/57969 cut-off events. [2022-12-12 21:19:09,354 INFO L131 PetriNetUnfolder]: For 3988/3991 co-relation queries the response was YES. [2022-12-12 21:19:09,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277096 conditions, 57969 events. 36047/57969 cut-off events. For 3988/3991 co-relation queries the response was YES. Maximal size of possible extension queue 2774. Compared 463473 event pairs, 3015 based on Foata normal form. 0/20106 useless extension candidates. Maximal degree in co-relation 273746. Up to 53335 conditions per place. [2022-12-12 21:19:09,697 INFO L137 encePairwiseOnDemand]: 98/117 looper letters, 722 selfloop transitions, 104 changer transitions 62/903 dead transitions. [2022-12-12 21:19:09,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 903 transitions, 8887 flow [2022-12-12 21:19:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 21:19:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 21:19:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 846 transitions. [2022-12-12 21:19:09,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-12 21:19:09,701 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2022-12-12 21:19:09,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 903 transitions, 8887 flow [2022-12-12 21:19:09,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 841 transitions, 8275 flow [2022-12-12 21:19:09,852 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 841 transitions, 8275 flow [2022-12-12 21:19:09,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:09,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:09,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:09,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 21:19:10,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:19:10,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash -773826679, now seen corresponding path program 1 times [2022-12-12 21:19:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:10,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558561467] [2022-12-12 21:19:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:10,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558561467] [2022-12-12 21:19:10,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558561467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:10,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:10,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:19:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102124748] [2022-12-12 21:19:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:10,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:19:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:19:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:19:10,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:19:10,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 841 transitions, 8275 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:10,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:10,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:19:10,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:11,968 INFO L130 PetriNetUnfolder]: 8779/15802 cut-off events. [2022-12-12 21:19:11,968 INFO L131 PetriNetUnfolder]: For 3025/3025 co-relation queries the response was YES. [2022-12-12 21:19:11,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91462 conditions, 15802 events. 8779/15802 cut-off events. For 3025/3025 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 120972 event pairs, 63 based on Foata normal form. 15/6134 useless extension candidates. Maximal degree in co-relation 88272. Up to 14335 conditions per place. [2022-12-12 21:19:12,024 INFO L137 encePairwiseOnDemand]: 92/117 looper letters, 274 selfloop transitions, 40 changer transitions 183/506 dead transitions. [2022-12-12 21:19:12,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 506 transitions, 5955 flow [2022-12-12 21:19:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:19:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:19:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-12 21:19:12,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2022-12-12 21:19:12,026 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-12-12 21:19:12,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 506 transitions, 5955 flow [2022-12-12 21:19:12,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 323 transitions, 3836 flow [2022-12-12 21:19:12,062 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 323 transitions, 3836 flow [2022-12-12 21:19:12,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:12,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:12,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:19:12,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1801917951, now seen corresponding path program 1 times [2022-12-12 21:19:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717534667] [2022-12-12 21:19:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:12,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717534667] [2022-12-12 21:19:12,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717534667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:12,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:12,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:19:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195304998] [2022-12-12 21:19:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:12,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:19:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:19:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:19:12,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:19:12,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 323 transitions, 3836 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:12,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:12,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:19:12,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:12,768 INFO L130 PetriNetUnfolder]: 4104/7380 cut-off events. [2022-12-12 21:19:12,768 INFO L131 PetriNetUnfolder]: For 1601/1601 co-relation queries the response was YES. [2022-12-12 21:19:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49039 conditions, 7380 events. 4104/7380 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 46945 event pairs, 63 based on Foata normal form. 0/4107 useless extension candidates. Maximal degree in co-relation 46912. Up to 6550 conditions per place. [2022-12-12 21:19:12,802 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 350 selfloop transitions, 13 changer transitions 0/374 dead transitions. [2022-12-12 21:19:12,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 374 transitions, 5186 flow [2022-12-12 21:19:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:19:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:19:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-12-12 21:19:12,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-12 21:19:12,804 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -41 predicate places. [2022-12-12 21:19:12,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 374 transitions, 5186 flow [2022-12-12 21:19:12,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 374 transitions, 5186 flow [2022-12-12 21:19:12,834 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 374 transitions, 5186 flow [2022-12-12 21:19:12,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:12,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:12,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:12,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:19:12,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1840425891, now seen corresponding path program 1 times [2022-12-12 21:19:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:12,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370337844] [2022-12-12 21:19:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370337844] [2022-12-12 21:19:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370337844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:13,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:13,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 21:19:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404040134] [2022-12-12 21:19:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:13,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 21:19:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 21:19:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-12 21:19:13,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 117 [2022-12-12 21:19:13,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 374 transitions, 5186 flow. Second operand has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:13,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:13,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 117 [2022-12-12 21:19:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:15,994 INFO L130 PetriNetUnfolder]: 7570/13489 cut-off events. [2022-12-12 21:19:15,995 INFO L131 PetriNetUnfolder]: For 5597/5597 co-relation queries the response was YES. [2022-12-12 21:19:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102043 conditions, 13489 events. 7570/13489 cut-off events. For 5597/5597 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 90864 event pairs, 78 based on Foata normal form. 0/7398 useless extension candidates. Maximal degree in co-relation 97128. Up to 12001 conditions per place. [2022-12-12 21:19:16,068 INFO L137 encePairwiseOnDemand]: 101/117 looper letters, 698 selfloop transitions, 47 changer transitions 5/759 dead transitions. [2022-12-12 21:19:16,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 759 transitions, 12115 flow [2022-12-12 21:19:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 21:19:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 21:19:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 663 transitions. [2022-12-12 21:19:16,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20987654320987653 [2022-12-12 21:19:16,072 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -15 predicate places. [2022-12-12 21:19:16,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 759 transitions, 12115 flow [2022-12-12 21:19:16,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 754 transitions, 12095 flow [2022-12-12 21:19:16,136 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 754 transitions, 12095 flow [2022-12-12 21:19:16,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:16,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:16,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:16,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:19:16,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1753380259, now seen corresponding path program 2 times [2022-12-12 21:19:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:16,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742720135] [2022-12-12 21:19:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:16,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742720135] [2022-12-12 21:19:16,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742720135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:16,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:16,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 21:19:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21528407] [2022-12-12 21:19:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:16,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 21:19:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 21:19:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-12-12 21:19:16,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 117 [2022-12-12 21:19:16,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 754 transitions, 12095 flow. Second operand has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:16,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:16,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 117 [2022-12-12 21:19:16,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:20,477 INFO L130 PetriNetUnfolder]: 13023/23170 cut-off events. [2022-12-12 21:19:20,477 INFO L131 PetriNetUnfolder]: For 9243/9243 co-relation queries the response was YES. [2022-12-12 21:19:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197652 conditions, 23170 events. 13023/23170 cut-off events. For 9243/9243 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 162898 event pairs, 121 based on Foata normal form. 0/12404 useless extension candidates. Maximal degree in co-relation 187534. Up to 20934 conditions per place. [2022-12-12 21:19:20,592 INFO L137 encePairwiseOnDemand]: 101/117 looper letters, 1220 selfloop transitions, 45 changer transitions 0/1274 dead transitions. [2022-12-12 21:19:20,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 1274 transitions, 23044 flow [2022-12-12 21:19:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 21:19:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 21:19:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 417 transitions. [2022-12-12 21:19:20,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25457875457875456 [2022-12-12 21:19:20,594 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2022-12-12 21:19:20,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 1274 transitions, 23044 flow [2022-12-12 21:19:20,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 1274 transitions, 23044 flow [2022-12-12 21:19:20,688 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 1274 transitions, 23044 flow [2022-12-12 21:19:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:20,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:20,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:20,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:19:20,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1512903721, now seen corresponding path program 3 times [2022-12-12 21:19:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:20,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294515536] [2022-12-12 21:19:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:21,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:21,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294515536] [2022-12-12 21:19:21,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294515536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:21,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:19:21,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 21:19:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072995457] [2022-12-12 21:19:21,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:21,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 21:19:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 21:19:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-12 21:19:21,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 117 [2022-12-12 21:19:21,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 1274 transitions, 23044 flow. Second operand has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:21,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:21,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 117 [2022-12-12 21:19:21,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:26,724 INFO L130 PetriNetUnfolder]: 15485/27585 cut-off events. [2022-12-12 21:19:26,724 INFO L131 PetriNetUnfolder]: For 14005/14005 co-relation queries the response was YES. [2022-12-12 21:19:26,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260810 conditions, 27585 events. 15485/27585 cut-off events. For 14005/14005 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 201886 event pairs, 263 based on Foata normal form. 0/14711 useless extension candidates. Maximal degree in co-relation 247215. Up to 25031 conditions per place. [2022-12-12 21:19:27,112 INFO L137 encePairwiseOnDemand]: 102/117 looper letters, 1426 selfloop transitions, 57 changer transitions 0/1492 dead transitions. [2022-12-12 21:19:27,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1492 transitions, 29979 flow [2022-12-12 21:19:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 21:19:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 21:19:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 417 transitions. [2022-12-12 21:19:27,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25457875457875456 [2022-12-12 21:19:27,117 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 9 predicate places. [2022-12-12 21:19:27,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 1492 transitions, 29979 flow [2022-12-12 21:19:27,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 1492 transitions, 29979 flow [2022-12-12 21:19:27,253 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 1492 transitions, 29979 flow [2022-12-12 21:19:27,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:27,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:27,253 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:27,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:19:27,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -658169330, now seen corresponding path program 1 times [2022-12-12 21:19:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815070831] [2022-12-12 21:19:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:19:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815070831] [2022-12-12 21:19:27,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815070831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:19:27,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908595987] [2022-12-12 21:19:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:19:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:19:27,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:19:27,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 21:19:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:19:27,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 21:19:27,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:19:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:19:27,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 21:19:27,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908595987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:19:27,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 21:19:27,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-12-12 21:19:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270031926] [2022-12-12 21:19:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:19:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:19:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:19:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:19:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:19:27,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-12 21:19:27,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 1492 transitions, 29979 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:27,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:19:27,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-12 21:19:27,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:19:34,051 INFO L130 PetriNetUnfolder]: 18082/32117 cut-off events. [2022-12-12 21:19:34,052 INFO L131 PetriNetUnfolder]: For 19308/19308 co-relation queries the response was YES. [2022-12-12 21:19:34,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333281 conditions, 32117 events. 18082/32117 cut-off events. For 19308/19308 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 235913 event pairs, 166 based on Foata normal form. 0/17090 useless extension candidates. Maximal degree in co-relation 316242. Up to 29224 conditions per place. [2022-12-12 21:19:34,219 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 1710 selfloop transitions, 60 changer transitions 0/1779 dead transitions. [2022-12-12 21:19:34,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 1779 transitions, 39298 flow [2022-12-12 21:19:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:19:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:19:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2022-12-12 21:19:34,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31196581196581197 [2022-12-12 21:19:34,221 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 16 predicate places. [2022-12-12 21:19:34,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 1779 transitions, 39298 flow [2022-12-12 21:19:34,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 1779 transitions, 39298 flow [2022-12-12 21:19:34,359 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 1779 transitions, 39298 flow [2022-12-12 21:19:34,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:19:34,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:19:34,359 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:34,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 21:19:34,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-12 21:19:34,564 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:19:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:19:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1400168364, now seen corresponding path program 1 times [2022-12-12 21:19:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:19:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606533344] [2022-12-12 21:19:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:19:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:19:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:19:34,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:19:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:19:34,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:19:34,634 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:19:34,635 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:19:34,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-12 21:19:34,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:19:34,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-12 21:19:34,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-12 21:19:34,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:19:34,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:19:34,638 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:19:34,645 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:19:34,645 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:19:34,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:19:34 BasicIcfg [2022-12-12 21:19:34,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:19:34,701 INFO L158 Benchmark]: Toolchain (without parser) took 42613.45ms. Allocated memory was 190.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 155.3MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 21:19:34,701 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:19:34,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.43ms. Allocated memory is still 190.8MB. Free memory was 155.2MB in the beginning and 125.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 21:19:34,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.08ms. Allocated memory is still 190.8MB. Free memory was 125.8MB in the beginning and 123.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:19:34,703 INFO L158 Benchmark]: Boogie Preprocessor took 38.57ms. Allocated memory is still 190.8MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:19:34,703 INFO L158 Benchmark]: RCFGBuilder took 490.05ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 103.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 21:19:34,703 INFO L158 Benchmark]: TraceAbstraction took 41351.19ms. Allocated memory was 190.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 102.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 21:19:34,704 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 668.43ms. Allocated memory is still 190.8MB. Free memory was 155.2MB in the beginning and 125.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.08ms. Allocated memory is still 190.8MB. Free memory was 125.8MB in the beginning and 123.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.57ms. Allocated memory is still 190.8MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.05ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 103.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 41351.19ms. Allocated memory was 190.8MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 102.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 147 PlacesBefore, 117 PlacesAfterwards, 150 TransitionsBefore, 117 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 83 ConcurrentYvCompositions, 10 ChoiceCompositions, 130 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18139, independent: 17854, independent conditional: 17854, independent unconditional: 0, dependent: 285, dependent conditional: 285, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18139, independent: 17854, independent conditional: 0, independent unconditional: 17854, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18139, independent: 17854, independent conditional: 0, independent unconditional: 17854, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18139, independent: 17854, independent conditional: 0, independent unconditional: 17854, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7545, independent: 7459, independent conditional: 0, independent unconditional: 7459, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7545, independent: 7438, independent conditional: 0, independent unconditional: 7438, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18139, independent: 10395, independent conditional: 0, independent unconditional: 10395, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 7545, unknown conditional: 0, unknown unconditional: 7545] , Statistics on independence cache: Total cache size (in pairs): 19665, Positive cache size: 19579, Positive conditional cache size: 0, Positive unconditional cache size: 19579, Negative cache size: 86, Negative conditional cache size: 0, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={6:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={6:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={3:0}, cond=1, flag=0, m={4:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=1, arr={3:0}, flag=0, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=1] [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=1, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 252 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2043 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2043 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8541 IncrementalHoareTripleChecker+Invalid, 8704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 8 mSDtfsCounter, 8541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39298occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 3081 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1567 SizeOfPredicates, 5 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 11/25 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:19:34,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...