./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:09:47,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:09:47,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:09:47,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:09:47,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:09:47,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:09:47,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:09:47,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:09:47,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:09:47,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:09:47,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:09:47,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:09:47,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:09:47,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:09:47,487 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:09:47,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:09:47,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:09:47,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:09:47,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:09:47,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:09:47,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:09:47,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:09:47,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:09:47,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:09:47,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:09:47,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:09:47,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:09:47,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:09:47,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:09:47,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:09:47,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:09:47,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:09:47,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:09:47,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:09:47,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:09:47,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:09:47,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:09:47,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:09:47,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:09:47,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:09:47,498 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:09:47,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:09:47,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:09:47,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2024-01-27 16:09:47,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:09:47,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:09:47,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:09:47,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:09:47,689 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:09:47,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2024-01-27 16:09:48,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:09:48,814 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:09:48,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i [2024-01-27 16:09:48,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cc29952/271be3a2d4ad4eeebff288e76685fa9a/FLAG2a7acd3e2 [2024-01-27 16:09:48,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cc29952/271be3a2d4ad4eeebff288e76685fa9a [2024-01-27 16:09:48,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:09:48,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:09:48,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:09:48,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:09:48,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:09:48,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:09:48" (1/1) ... [2024-01-27 16:09:48,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ac2f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:48, skipping insertion in model container [2024-01-27 16:09:48,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:09:48" (1/1) ... [2024-01-27 16:09:48,885 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:09:48,999 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i[944,957] [2024-01-27 16:09:49,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:09:49,174 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:09:49,183 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.opt.i[944,957] [2024-01-27 16:09:49,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:09:49,262 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:09:49,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49 WrapperNode [2024-01-27 16:09:49,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:09:49,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:09:49,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:09:49,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:09:49,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,315 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2024-01-27 16:09:49,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:09:49,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:09:49,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:09:49,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:09:49,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,354 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 16:09:49,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:09:49,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:09:49,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:09:49,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:09:49,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (1/1) ... [2024-01-27 16:09:49,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:09:49,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:09:49,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:09:49,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:09:49,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:09:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:09:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:09:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:09:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:09:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:09:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:09:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:09:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:09:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:09:49,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:09:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:09:49,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:09:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:09:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:09:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-27 16:09:49,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-27 16:09:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:09:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:09:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:09:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:09:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:09:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:09:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:09:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:09:49,487 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:09:49,657 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:09:49,659 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:09:49,932 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:09:49,933 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:09:50,093 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:09:50,094 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:09:50,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:09:50 BoogieIcfgContainer [2024-01-27 16:09:50,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:09:50,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:09:50,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:09:50,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:09:50,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:09:48" (1/3) ... [2024-01-27 16:09:50,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334d786f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:09:50, skipping insertion in model container [2024-01-27 16:09:50,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:09:49" (2/3) ... [2024-01-27 16:09:50,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334d786f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:09:50, skipping insertion in model container [2024-01-27 16:09:50,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:09:50" (3/3) ... [2024-01-27 16:09:50,101 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2024-01-27 16:09:50,108 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:09:50,115 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:09:50,115 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:09:50,115 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:09:50,170 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:09:50,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-01-27 16:09:50,234 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-01-27 16:09:50,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:09:50,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-01-27 16:09:50,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-01-27 16:09:50,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-01-27 16:09:50,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:09:50,270 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1947a857, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:09:50,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:09:50,284 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:09:50,284 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-01-27 16:09:50,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:09:50,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:50,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:50,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:50,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 830149687, now seen corresponding path program 1 times [2024-01-27 16:09:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751987725] [2024-01-27 16:09:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751987725] [2024-01-27 16:09:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751987725] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:09:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722932048] [2024-01-27 16:09:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:50,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:09:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:09:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:09:50,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-01-27 16:09:50,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2024-01-27 16:09:50,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:50,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-01-27 16:09:50,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:09:50,990 INFO L124 PetriNetUnfolderBase]: 879/1527 cut-off events. [2024-01-27 16:09:50,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:09:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1527 events. 879/1527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10504 event pairs, 159 based on Foata normal form. 60/1545 useless extension candidates. Maximal degree in co-relation 2835. Up to 1009 conditions per place. [2024-01-27 16:09:51,004 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-01-27 16:09:51,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2024-01-27 16:09:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:09:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:09:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-27 16:09:51,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.76 [2024-01-27 16:09:51,016 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2024-01-27 16:09:51,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2024-01-27 16:09:51,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:09:51,025 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-01-27 16:09:51,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-01-27 16:09:51,030 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-01-27 16:09:51,031 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-01-27 16:09:51,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2024-01-27 16:09:51,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:51,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:51,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:09:51,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:51,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 944084550, now seen corresponding path program 1 times [2024-01-27 16:09:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:51,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434192433] [2024-01-27 16:09:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434192433] [2024-01-27 16:09:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434192433] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:09:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644731454] [2024-01-27 16:09:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:51,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:09:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:09:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:09:51,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-01-27 16:09:51,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2024-01-27 16:09:51,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:51,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-01-27 16:09:51,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:09:53,178 INFO L124 PetriNetUnfolderBase]: 13564/20514 cut-off events. [2024-01-27 16:09:53,179 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2024-01-27 16:09:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40114 conditions, 20514 events. 13564/20514 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 156090 event pairs, 3390 based on Foata normal form. 0/19891 useless extension candidates. Maximal degree in co-relation 40104. Up to 8336 conditions per place. [2024-01-27 16:09:53,288 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 43 selfloop transitions, 8 changer transitions 84/150 dead transitions. [2024-01-27 16:09:53,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 150 transitions, 602 flow [2024-01-27 16:09:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:09:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:09:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2024-01-27 16:09:53,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844444444444444 [2024-01-27 16:09:53,292 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 9 states and 308 transitions. [2024-01-27 16:09:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 150 transitions, 602 flow [2024-01-27 16:09:53,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 150 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:09:53,301 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 204 flow [2024-01-27 16:09:53,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=204, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2024-01-27 16:09:53,302 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-01-27 16:09:53,302 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 204 flow [2024-01-27 16:09:53,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2024-01-27 16:09:53,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:53,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:09:53,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:53,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1594332487, now seen corresponding path program 1 times [2024-01-27 16:09:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:53,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273492148] [2024-01-27 16:09:53,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273492148] [2024-01-27 16:09:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273492148] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:53,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:09:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823212593] [2024-01-27 16:09:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:53,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:09:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:53,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:09:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:09:53,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-01-27 16:09:53,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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) [2024-01-27 16:09:53,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:53,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-01-27 16:09:53,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:09:54,995 INFO L124 PetriNetUnfolderBase]: 9538/15234 cut-off events. [2024-01-27 16:09:54,995 INFO L125 PetriNetUnfolderBase]: For 22109/22109 co-relation queries the response was YES. [2024-01-27 16:09:55,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46611 conditions, 15234 events. 9538/15234 cut-off events. For 22109/22109 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 117645 event pairs, 1728 based on Foata normal form. 420/15566 useless extension candidates. Maximal degree in co-relation 46593. Up to 5580 conditions per place. [2024-01-27 16:09:55,075 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 50 selfloop transitions, 9 changer transitions 76/150 dead transitions. [2024-01-27 16:09:55,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 1006 flow [2024-01-27 16:09:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:09:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:09:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 312 transitions. [2024-01-27 16:09:55,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.624 [2024-01-27 16:09:55,078 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 204 flow. Second operand 10 states and 312 transitions. [2024-01-27 16:09:55,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 1006 flow [2024-01-27 16:09:55,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 150 transitions, 856 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-01-27 16:09:55,144 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 270 flow [2024-01-27 16:09:55,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-01-27 16:09:55,145 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-01-27 16:09:55,145 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 270 flow [2024-01-27 16:09:55,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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) [2024-01-27 16:09:55,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:55,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:55,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:09:55,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:55,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 718468970, now seen corresponding path program 1 times [2024-01-27 16:09:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083236371] [2024-01-27 16:09:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:55,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:55,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083236371] [2024-01-27 16:09:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083236371] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:09:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080608279] [2024-01-27 16:09:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:55,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:09:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:09:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:09:55,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:09:55,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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) [2024-01-27 16:09:55,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:55,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:09:55,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:09:56,502 INFO L124 PetriNetUnfolderBase]: 7063/12171 cut-off events. [2024-01-27 16:09:56,502 INFO L125 PetriNetUnfolderBase]: For 21821/21921 co-relation queries the response was YES. [2024-01-27 16:09:56,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36745 conditions, 12171 events. 7063/12171 cut-off events. For 21821/21921 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 100383 event pairs, 1980 based on Foata normal form. 296/12255 useless extension candidates. Maximal degree in co-relation 36720. Up to 7257 conditions per place. [2024-01-27 16:09:56,576 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 42 selfloop transitions, 6 changer transitions 33/104 dead transitions. [2024-01-27 16:09:56,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 684 flow [2024-01-27 16:09:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:09:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:09:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2024-01-27 16:09:56,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6371428571428571 [2024-01-27 16:09:56,578 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 270 flow. Second operand 7 states and 223 transitions. [2024-01-27 16:09:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 684 flow [2024-01-27 16:09:56,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 104 transitions, 651 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-01-27 16:09:56,746 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 331 flow [2024-01-27 16:09:56,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-01-27 16:09:56,747 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-01-27 16:09:56,747 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 331 flow [2024-01-27 16:09:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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) [2024-01-27 16:09:56,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:56,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:56,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:09:56,748 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:56,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1495087981, now seen corresponding path program 1 times [2024-01-27 16:09:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460293019] [2024-01-27 16:09:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460293019] [2024-01-27 16:09:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460293019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:09:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123498632] [2024-01-27 16:09:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:56,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:09:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:09:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:09:56,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-01-27 16:09:56,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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) [2024-01-27 16:09:56,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:56,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-01-27 16:09:56,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:09:57,922 INFO L124 PetriNetUnfolderBase]: 5527/9632 cut-off events. [2024-01-27 16:09:57,923 INFO L125 PetriNetUnfolderBase]: For 16950/17843 co-relation queries the response was YES. [2024-01-27 16:09:58,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29549 conditions, 9632 events. 5527/9632 cut-off events. For 16950/17843 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 79109 event pairs, 1439 based on Foata normal form. 301/9444 useless extension candidates. Maximal degree in co-relation 29522. Up to 4493 conditions per place. [2024-01-27 16:09:58,182 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 36 selfloop transitions, 4 changer transitions 29/99 dead transitions. [2024-01-27 16:09:58,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 633 flow [2024-01-27 16:09:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:09:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:09:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-01-27 16:09:58,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2024-01-27 16:09:58,186 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 331 flow. Second operand 7 states and 222 transitions. [2024-01-27 16:09:58,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 633 flow [2024-01-27 16:09:58,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 589 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-01-27 16:09:58,277 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 313 flow [2024-01-27 16:09:58,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-01-27 16:09:58,279 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-01-27 16:09:58,279 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 313 flow [2024-01-27 16:09:58,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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) [2024-01-27 16:09:58,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:09:58,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:58,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:09:58,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:58,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1801942627, now seen corresponding path program 1 times [2024-01-27 16:09:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263326646] [2024-01-27 16:09:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:09:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:09:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:09:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263326646] [2024-01-27 16:09:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263326646] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:09:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:09:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:09:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682064409] [2024-01-27 16:09:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:09:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:09:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:09:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:09:58,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:09:58,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:09:58,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2024-01-27 16:09:58,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:09:58,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:09:58,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:00,390 INFO L124 PetriNetUnfolderBase]: 14878/22627 cut-off events. [2024-01-27 16:10:00,390 INFO L125 PetriNetUnfolderBase]: For 29897/33563 co-relation queries the response was YES. [2024-01-27 16:10:00,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61049 conditions, 22627 events. 14878/22627 cut-off events. For 29897/33563 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 168579 event pairs, 2416 based on Foata normal form. 1055/22798 useless extension candidates. Maximal degree in co-relation 61022. Up to 11335 conditions per place. [2024-01-27 16:10:00,523 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 56 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2024-01-27 16:10:00,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 571 flow [2024-01-27 16:10:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:10:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:10:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-01-27 16:10:00,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715 [2024-01-27 16:10:00,525 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 313 flow. Second operand 4 states and 143 transitions. [2024-01-27 16:10:00,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 571 flow [2024-01-27 16:10:00,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 553 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:00,628 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 341 flow [2024-01-27 16:10:00,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2024-01-27 16:10:00,631 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2024-01-27 16:10:00,631 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 341 flow [2024-01-27 16:10:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2024-01-27 16:10:00,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:00,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:00,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:10:00,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:00,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1683052997, now seen corresponding path program 1 times [2024-01-27 16:10:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743592294] [2024-01-27 16:10:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743592294] [2024-01-27 16:10:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743592294] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:10:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572082764] [2024-01-27 16:10:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:00,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:00,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 341 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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) [2024-01-27 16:10:00,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:00,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:00,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:02,653 INFO L124 PetriNetUnfolderBase]: 13155/20224 cut-off events. [2024-01-27 16:10:02,653 INFO L125 PetriNetUnfolderBase]: For 24437/28295 co-relation queries the response was YES. [2024-01-27 16:10:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59509 conditions, 20224 events. 13155/20224 cut-off events. For 24437/28295 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 147901 event pairs, 1165 based on Foata normal form. 1084/20601 useless extension candidates. Maximal degree in co-relation 59484. Up to 8164 conditions per place. [2024-01-27 16:10:02,753 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 73 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2024-01-27 16:10:02,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 726 flow [2024-01-27 16:10:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:10:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:10:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-01-27 16:10:02,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.732 [2024-01-27 16:10:02,755 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 341 flow. Second operand 5 states and 183 transitions. [2024-01-27 16:10:02,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 726 flow [2024-01-27 16:10:02,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:10:02,770 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 406 flow [2024-01-27 16:10:02,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2024-01-27 16:10:02,771 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-01-27 16:10:02,771 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 406 flow [2024-01-27 16:10:02,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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) [2024-01-27 16:10:02,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:02,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:02,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:10:02,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:02,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1107285911, now seen corresponding path program 1 times [2024-01-27 16:10:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:02,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251530571] [2024-01-27 16:10:02,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:02,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251530571] [2024-01-27 16:10:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251530571] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:10:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824723699] [2024-01-27 16:10:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:02,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:02,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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) [2024-01-27 16:10:02,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:02,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:02,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:04,669 INFO L124 PetriNetUnfolderBase]: 10671/16392 cut-off events. [2024-01-27 16:10:04,669 INFO L125 PetriNetUnfolderBase]: For 31291/36512 co-relation queries the response was YES. [2024-01-27 16:10:04,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54299 conditions, 16392 events. 10671/16392 cut-off events. For 31291/36512 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 115418 event pairs, 651 based on Foata normal form. 921/16673 useless extension candidates. Maximal degree in co-relation 54271. Up to 5684 conditions per place. [2024-01-27 16:10:04,751 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 86 selfloop transitions, 14 changer transitions 0/130 dead transitions. [2024-01-27 16:10:04,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 891 flow [2024-01-27 16:10:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:10:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:10:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-01-27 16:10:04,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7366666666666667 [2024-01-27 16:10:04,753 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 406 flow. Second operand 6 states and 221 transitions. [2024-01-27 16:10:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 891 flow [2024-01-27 16:10:04,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 875 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:04,771 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 476 flow [2024-01-27 16:10:04,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2024-01-27 16:10:04,772 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-01-27 16:10:04,772 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 476 flow [2024-01-27 16:10:04,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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) [2024-01-27 16:10:04,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:04,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:10:04,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:04,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1518118453, now seen corresponding path program 1 times [2024-01-27 16:10:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:04,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884758240] [2024-01-27 16:10:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884758240] [2024-01-27 16:10:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884758240] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:10:04,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409979475] [2024-01-27 16:10:04,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:04,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:04,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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) [2024-01-27 16:10:04,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:04,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:04,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:06,461 INFO L124 PetriNetUnfolderBase]: 10272/18188 cut-off events. [2024-01-27 16:10:06,461 INFO L125 PetriNetUnfolderBase]: For 33826/38393 co-relation queries the response was YES. [2024-01-27 16:10:06,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56958 conditions, 18188 events. 10272/18188 cut-off events. For 33826/38393 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 160053 event pairs, 3364 based on Foata normal form. 545/16767 useless extension candidates. Maximal degree in co-relation 56928. Up to 7152 conditions per place. [2024-01-27 16:10:06,580 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 61 selfloop transitions, 3 changer transitions 14/123 dead transitions. [2024-01-27 16:10:06,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 123 transitions, 864 flow [2024-01-27 16:10:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:10:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:10:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-01-27 16:10:06,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2024-01-27 16:10:06,581 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 476 flow. Second operand 6 states and 202 transitions. [2024-01-27 16:10:06,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 123 transitions, 864 flow [2024-01-27 16:10:06,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 123 transitions, 833 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-27 16:10:06,695 INFO L231 Difference]: Finished difference. Result has 86 places, 75 transitions, 482 flow [2024-01-27 16:10:06,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2024-01-27 16:10:06,696 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2024-01-27 16:10:06,696 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 482 flow [2024-01-27 16:10:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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) [2024-01-27 16:10:06,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:06,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:10:06,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:06,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1458888559, now seen corresponding path program 2 times [2024-01-27 16:10:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193052300] [2024-01-27 16:10:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:06,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193052300] [2024-01-27 16:10:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193052300] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:06,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:10:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246732079] [2024-01-27 16:10:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:06,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:10:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:10:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:10:06,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:06,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 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) [2024-01-27 16:10:06,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:06,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:06,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:09,013 INFO L124 PetriNetUnfolderBase]: 14986/22823 cut-off events. [2024-01-27 16:10:09,013 INFO L125 PetriNetUnfolderBase]: For 46658/54940 co-relation queries the response was YES. [2024-01-27 16:10:09,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76299 conditions, 22823 events. 14986/22823 cut-off events. For 46658/54940 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 172242 event pairs, 1017 based on Foata normal form. 1035/22818 useless extension candidates. Maximal degree in co-relation 76266. Up to 8592 conditions per place. [2024-01-27 16:10:09,147 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 72 selfloop transitions, 18 changer transitions 6/128 dead transitions. [2024-01-27 16:10:09,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 128 transitions, 884 flow [2024-01-27 16:10:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:10:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:10:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-01-27 16:10:09,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885714285714286 [2024-01-27 16:10:09,149 INFO L175 Difference]: Start difference. First operand has 86 places, 75 transitions, 482 flow. Second operand 7 states and 241 transitions. [2024-01-27 16:10:09,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 128 transitions, 884 flow [2024-01-27 16:10:09,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 848 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-01-27 16:10:09,480 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 515 flow [2024-01-27 16:10:09,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-01-27 16:10:09,481 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2024-01-27 16:10:09,481 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 515 flow [2024-01-27 16:10:09,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 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) [2024-01-27 16:10:09,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:09,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:09,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:10:09,482 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:09,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 503815517, now seen corresponding path program 1 times [2024-01-27 16:10:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807285496] [2024-01-27 16:10:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:09,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807285496] [2024-01-27 16:10:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807285496] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:09,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:10:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992033096] [2024-01-27 16:10:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:09,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:09,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:09,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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) [2024-01-27 16:10:09,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:09,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:09,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:11,522 INFO L124 PetriNetUnfolderBase]: 13357/25083 cut-off events. [2024-01-27 16:10:11,522 INFO L125 PetriNetUnfolderBase]: For 54631/59615 co-relation queries the response was YES. [2024-01-27 16:10:11,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80765 conditions, 25083 events. 13357/25083 cut-off events. For 54631/59615 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 248661 event pairs, 4428 based on Foata normal form. 388/22586 useless extension candidates. Maximal degree in co-relation 80735. Up to 7553 conditions per place. [2024-01-27 16:10:11,696 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 38 selfloop transitions, 2 changer transitions 34/119 dead transitions. [2024-01-27 16:10:11,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 829 flow [2024-01-27 16:10:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:10:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:10:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-01-27 16:10:11,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-01-27 16:10:11,698 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 515 flow. Second operand 6 states and 195 transitions. [2024-01-27 16:10:11,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 829 flow [2024-01-27 16:10:12,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 730 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:12,884 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 425 flow [2024-01-27 16:10:12,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2024-01-27 16:10:12,885 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2024-01-27 16:10:12,885 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 425 flow [2024-01-27 16:10:12,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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) [2024-01-27 16:10:12,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:12,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:12,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:10:12,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:12,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 798150671, now seen corresponding path program 2 times [2024-01-27 16:10:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479527538] [2024-01-27 16:10:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:10:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479527538] [2024-01-27 16:10:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479527538] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:10:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615213700] [2024-01-27 16:10:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:13,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-01-27 16:10:13,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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) [2024-01-27 16:10:13,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:13,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-01-27 16:10:13,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:14,733 INFO L124 PetriNetUnfolderBase]: 11328/21180 cut-off events. [2024-01-27 16:10:14,733 INFO L125 PetriNetUnfolderBase]: For 30391/32989 co-relation queries the response was YES. [2024-01-27 16:10:14,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59941 conditions, 21180 events. 11328/21180 cut-off events. For 30391/32989 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 207408 event pairs, 4383 based on Foata normal form. 286/18512 useless extension candidates. Maximal degree in co-relation 59910. Up to 9897 conditions per place. [2024-01-27 16:10:14,865 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 3 changer transitions 32/98 dead transitions. [2024-01-27 16:10:14,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 631 flow [2024-01-27 16:10:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:10:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:10:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-01-27 16:10:14,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644 [2024-01-27 16:10:14,866 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 425 flow. Second operand 5 states and 161 transitions. [2024-01-27 16:10:14,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 631 flow [2024-01-27 16:10:15,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 620 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-27 16:10:15,565 INFO L231 Difference]: Finished difference. Result has 89 places, 61 transitions, 342 flow [2024-01-27 16:10:15,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=89, PETRI_TRANSITIONS=61} [2024-01-27 16:10:15,566 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2024-01-27 16:10:15,566 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 61 transitions, 342 flow [2024-01-27 16:10:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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) [2024-01-27 16:10:15,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:15,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:15,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:10:15,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:10:15,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -580596033, now seen corresponding path program 3 times [2024-01-27 16:10:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594390591] [2024-01-27 16:10:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:15,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:10:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:15,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:10:15,717 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:10:15,718 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:10:15,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:10:15,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:10:15,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:10:15,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-01-27 16:10:15,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-01-27 16:10:15,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:10:15,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 16:10:15,722 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:15,728 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:10:15,728 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:10:15,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:10:15 BasicIcfg [2024-01-27 16:10:15,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:10:15,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:10:15,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:10:15,812 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:10:15,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:09:50" (3/4) ... [2024-01-27 16:10:15,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:10:15,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:10:15,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:10:15,935 INFO L158 Benchmark]: Toolchain (without parser) took 27089.67ms. Allocated memory was 157.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 100.0MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2024-01-27 16:10:15,935 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 124.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:10:15,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.18ms. Allocated memory is still 157.3MB. Free memory was 100.0MB in the beginning and 75.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 16:10:15,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.10ms. Allocated memory is still 157.3MB. Free memory was 75.1MB in the beginning and 72.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:10:15,936 INFO L158 Benchmark]: Boogie Preprocessor took 65.03ms. Allocated memory is still 157.3MB. Free memory was 72.2MB in the beginning and 68.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:10:15,936 INFO L158 Benchmark]: RCFGBuilder took 713.15ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 68.3MB in the beginning and 119.9MB in the end (delta: -51.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-01-27 16:10:15,936 INFO L158 Benchmark]: TraceAbstraction took 25714.58ms. Allocated memory was 201.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 119.9MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2024-01-27 16:10:15,936 INFO L158 Benchmark]: Witness Printer took 122.81ms. Allocated memory is still 9.5GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-01-27 16:10:15,940 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 124.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.18ms. Allocated memory is still 157.3MB. Free memory was 100.0MB in the beginning and 75.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.10ms. Allocated memory is still 157.3MB. Free memory was 75.1MB in the beginning and 72.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.03ms. Allocated memory is still 157.3MB. Free memory was 72.2MB in the beginning and 68.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.15ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 68.3MB in the beginning and 119.9MB in the end (delta: -51.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25714.58ms. Allocated memory was 201.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 119.9MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 122.81ms. Allocated memory is still 9.5GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1634 IncrementalHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 70 mSDtfsCounter, 1634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=10, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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! [2024-01-27 16:10:15,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE