./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:12:23,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:12:23,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:12:23,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:12:23,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:12:23,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:12:23,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:12:23,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:12:23,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:12:23,524 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:12:23,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:12:23,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:12:23,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:12:23,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:12:23,530 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:12:23,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:12:23,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:12:23,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:12:23,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:12:23,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:12:23,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:12:23,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:12:23,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:12:23,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:12:23,537 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:12:23,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:12:23,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:12:23,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:12:23,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:12:23,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:12:23,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:12:23,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:23,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:12:23,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:12:23,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:12:23,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:12:23,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:12:23,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:12:23,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:12:23,544 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:12:23,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:12:23,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:12:23,546 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2023-11-21 22:12:23,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:12:23,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:12:23,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:12:23,847 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:12:23,848 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:12:23,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 22:12:27,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:12:27,530 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:12:27,531 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 22:12:27,550 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/data/893482c43/15ced7816d0d432f86310a4e3868d290/FLAG7dbe3a9ce [2023-11-21 22:12:27,566 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/data/893482c43/15ced7816d0d432f86310a4e3868d290 [2023-11-21 22:12:27,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:12:27,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:12:27,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:27,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:12:27,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:12:27,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:27" (1/1) ... [2023-11-21 22:12:27,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44aa5244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:27, skipping insertion in model container [2023-11-21 22:12:27,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:27" (1/1) ... [2023-11-21 22:12:27,636 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:12:27,820 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-21 22:12:28,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:28,064 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:12:28,077 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-21 22:12:28,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:28,180 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:12:28,181 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:12:28,189 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:12:28,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28 WrapperNode [2023-11-21 22:12:28,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:28,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:28,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:12:28,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:12:28,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,293 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-11-21 22:12:28,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:28,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:12:28,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:12:28,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:12:28,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,326 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,352 INFO L187 HeapSplitter]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1] [2023-11-21 22:12:28,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:12:28,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:12:28,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:12:28,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:12:28,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (1/1) ... [2023-11-21 22:12:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:28,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:28,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:12:28,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:12:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:12:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:12:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:12:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 22:12:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:12:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:12:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:12:28,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:12:28,454 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:12:28,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:12:28,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:12:28,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:12:28,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:12:28,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:12:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:12:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:12:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:12:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 22:12:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:12:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:12:28,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:12:28,460 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:12:28,616 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:12:28,618 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:12:29,053 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:12:29,318 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:12:29,319 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:12:29,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:29 BoogieIcfgContainer [2023-11-21 22:12:29,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:12:29,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:12:29,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:12:29,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:12:29,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:12:27" (1/3) ... [2023-11-21 22:12:29,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceb3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:29, skipping insertion in model container [2023-11-21 22:12:29,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:28" (2/3) ... [2023-11-21 22:12:29,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceb3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:29, skipping insertion in model container [2023-11-21 22:12:29,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:29" (3/3) ... [2023-11-21 22:12:29,335 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 22:12:29,347 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:12:29,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:12:29,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 22:12:29,360 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:12:29,419 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:12:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2023-11-21 22:12:29,489 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-11-21 22:12:29,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:12:29,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-21 22:12:29,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2023-11-21 22:12:29,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2023-11-21 22:12:29,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:12:29,528 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;@18273214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:12:29,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-21 22:12:29,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:12:29,533 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-21 22:12:29,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:12:29,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:29,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-21 22:12:29,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:29,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 11417118, now seen corresponding path program 1 times [2023-11-21 22:12:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164816229] [2023-11-21 22:12:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164816229] [2023-11-21 22:12:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164816229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:30,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:12:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727838009] [2023-11-21 22:12:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:12:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:12:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:12:30,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2023-11-21 22:12:30,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-21 22:12:30,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:30,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2023-11-21 22:12:30,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:30,597 INFO L124 PetriNetUnfolderBase]: 617/1109 cut-off events. [2023-11-21 22:12:30,597 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-21 22:12:30,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 1109 events. 617/1109 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6395 event pairs, 343 based on Foata normal form. 45/1132 useless extension candidates. Maximal degree in co-relation 2075. Up to 763 conditions per place. [2023-11-21 22:12:30,619 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-21 22:12:30,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 181 flow [2023-11-21 22:12:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:12:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:12:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-21 22:12:30,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7804878048780488 [2023-11-21 22:12:30,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-21 22:12:30,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-21 22:12:30,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:30,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-21 22:12:30,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2023-11-21 22:12:30,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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) [2023-11-21 22:12:30,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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) [2023-11-21 22:12:30,654 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 96 transitions. [2023-11-21 22:12:30,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 181 flow [2023-11-21 22:12:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:12:30,699 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2023-11-21 22:12:30,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-21 22:12:30,705 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-21 22:12:30,705 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2023-11-21 22:12:30,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-21 22:12:30,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:30,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:30,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:12:30,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:30,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 52485159, now seen corresponding path program 1 times [2023-11-21 22:12:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354535759] [2023-11-21 22:12:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354535759] [2023-11-21 22:12:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354535759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:12:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858580443] [2023-11-21 22:12:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:12:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:12:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:12:31,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-21 22:12:31,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2023-11-21 22:12:31,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:31,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-21 22:12:31,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:31,554 INFO L124 PetriNetUnfolderBase]: 1318/2360 cut-off events. [2023-11-21 22:12:31,554 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-21 22:12:31,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 2360 events. 1318/2360 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15120 event pairs, 188 based on Foata normal form. 100/2330 useless extension candidates. Maximal degree in co-relation 4529. Up to 1053 conditions per place. [2023-11-21 22:12:31,576 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2023-11-21 22:12:31,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 232 flow [2023-11-21 22:12:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:12:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:12:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2023-11-21 22:12:31,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6890243902439024 [2023-11-21 22:12:31,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 113 transitions. [2023-11-21 22:12:31,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 113 transitions. [2023-11-21 22:12:31,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:31,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 113 transitions. [2023-11-21 22:12:31,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-11-21 22:12:31,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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) [2023-11-21 22:12:31,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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) [2023-11-21 22:12:31,583 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 113 transitions. [2023-11-21 22:12:31,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 232 flow [2023-11-21 22:12:31,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:12:31,587 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2023-11-21 22:12:31,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-21 22:12:31,588 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-11-21 22:12:31,588 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2023-11-21 22:12:31,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2023-11-21 22:12:31,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:31,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:31,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:12:31,590 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:31,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 92975593, now seen corresponding path program 1 times [2023-11-21 22:12:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518719826] [2023-11-21 22:12:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518719826] [2023-11-21 22:12:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518719826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:12:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103133186] [2023-11-21 22:12:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:31,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:12:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:12:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:12:31,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-21 22:12:31,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-21 22:12:31,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:31,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-21 22:12:31,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:32,313 INFO L124 PetriNetUnfolderBase]: 886/1574 cut-off events. [2023-11-21 22:12:32,314 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2023-11-21 22:12:32,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 1574 events. 886/1574 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8806 event pairs, 100 based on Foata normal form. 82/1576 useless extension candidates. Maximal degree in co-relation 3539. Up to 465 conditions per place. [2023-11-21 22:12:32,327 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2023-11-21 22:12:32,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 325 flow [2023-11-21 22:12:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:12:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:12:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2023-11-21 22:12:32,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2023-11-21 22:12:32,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 143 transitions. [2023-11-21 22:12:32,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 143 transitions. [2023-11-21 22:12:32,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:32,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 143 transitions. [2023-11-21 22:12:32,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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) [2023-11-21 22:12:32,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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) [2023-11-21 22:12:32,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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) [2023-11-21 22:12:32,333 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 143 transitions. [2023-11-21 22:12:32,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 325 flow [2023-11-21 22:12:32,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:12:32,338 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2023-11-21 22:12:32,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-21 22:12:32,339 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2023-11-21 22:12:32,339 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2023-11-21 22:12:32,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-21 22:12:32,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:32,340 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] [2023-11-21 22:12:32,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:12:32,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:32,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1407059354, now seen corresponding path program 1 times [2023-11-21 22:12:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404062125] [2023-11-21 22:12:32,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:32,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:32,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404062125] [2023-11-21 22:12:32,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404062125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:32,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:32,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:12:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661941793] [2023-11-21 22:12:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:32,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:12:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:12:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:12:32,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-21 22:12:32,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-21 22:12:32,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:32,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-21 22:12:32,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:32,904 INFO L124 PetriNetUnfolderBase]: 557/947 cut-off events. [2023-11-21 22:12:32,905 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-11-21 22:12:32,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 947 events. 557/947 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4351 event pairs, 83 based on Foata normal form. 40/944 useless extension candidates. Maximal degree in co-relation 2427. Up to 308 conditions per place. [2023-11-21 22:12:32,914 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2023-11-21 22:12:32,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 332 flow [2023-11-21 22:12:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:12:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:12:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2023-11-21 22:12:32,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2023-11-21 22:12:32,917 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 155 transitions. [2023-11-21 22:12:32,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 155 transitions. [2023-11-21 22:12:32,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:32,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 155 transitions. [2023-11-21 22:12:32,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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) [2023-11-21 22:12:32,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 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) [2023-11-21 22:12:32,920 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 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) [2023-11-21 22:12:32,920 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 155 transitions. [2023-11-21 22:12:32,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 332 flow [2023-11-21 22:12:32,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-21 22:12:32,929 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2023-11-21 22:12:32,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-11-21 22:12:32,930 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-11-21 22:12:32,930 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2023-11-21 22:12:32,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-21 22:12:32,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:32,931 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] [2023-11-21 22:12:32,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:12:32,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:32,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1436343748, now seen corresponding path program 1 times [2023-11-21 22:12:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767205663] [2023-11-21 22:12:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767205663] [2023-11-21 22:12:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767205663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:34,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:12:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023394593] [2023-11-21 22:12:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:34,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:12:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:12:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:12:34,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-21 22:12:34,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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) [2023-11-21 22:12:34,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:34,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-21 22:12:34,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:34,851 INFO L124 PetriNetUnfolderBase]: 455/867 cut-off events. [2023-11-21 22:12:34,852 INFO L125 PetriNetUnfolderBase]: For 517/531 co-relation queries the response was YES. [2023-11-21 22:12:34,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2101 conditions, 867 events. 455/867 cut-off events. For 517/531 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4373 event pairs, 102 based on Foata normal form. 8/833 useless extension candidates. Maximal degree in co-relation 2086. Up to 236 conditions per place. [2023-11-21 22:12:34,859 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 32 selfloop transitions, 4 changer transitions 24/81 dead transitions. [2023-11-21 22:12:34,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 380 flow [2023-11-21 22:12:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:12:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 22:12:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2023-11-21 22:12:34,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043360433604336 [2023-11-21 22:12:34,862 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 223 transitions. [2023-11-21 22:12:34,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 223 transitions. [2023-11-21 22:12:34,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:34,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 223 transitions. [2023-11-21 22:12:34,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 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) [2023-11-21 22:12:34,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 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) [2023-11-21 22:12:34,866 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 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) [2023-11-21 22:12:34,866 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 9 states and 223 transitions. [2023-11-21 22:12:34,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 380 flow [2023-11-21 22:12:34,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 316 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-21 22:12:34,873 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 126 flow [2023-11-21 22:12:34,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-11-21 22:12:34,875 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2023-11-21 22:12:34,875 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 126 flow [2023-11-21 22:12:34,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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) [2023-11-21 22:12:34,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:34,876 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] [2023-11-21 22:12:34,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:12:34,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:34,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1773973528, now seen corresponding path program 2 times [2023-11-21 22:12:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630424421] [2023-11-21 22:12:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630424421] [2023-11-21 22:12:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630424421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:35,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:35,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:12:35,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087869544] [2023-11-21 22:12:35,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:35,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:12:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:12:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:12:35,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-21 22:12:35,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-21 22:12:35,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:35,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-21 22:12:35,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:35,690 INFO L124 PetriNetUnfolderBase]: 694/1343 cut-off events. [2023-11-21 22:12:35,690 INFO L125 PetriNetUnfolderBase]: For 219/230 co-relation queries the response was YES. [2023-11-21 22:12:35,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1343 events. 694/1343 cut-off events. For 219/230 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7607 event pairs, 321 based on Foata normal form. 8/1283 useless extension candidates. Maximal degree in co-relation 2861. Up to 605 conditions per place. [2023-11-21 22:12:35,700 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 30 selfloop transitions, 2 changer transitions 13/64 dead transitions. [2023-11-21 22:12:35,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 278 flow [2023-11-21 22:12:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:12:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:12:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-21 22:12:35,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2023-11-21 22:12:35,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-21 22:12:35,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-21 22:12:35,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:35,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-21 22:12:35,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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) [2023-11-21 22:12:35,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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) [2023-11-21 22:12:35,705 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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) [2023-11-21 22:12:35,706 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 126 flow. Second operand 5 states and 126 transitions. [2023-11-21 22:12:35,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 278 flow [2023-11-21 22:12:35,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 256 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-21 22:12:35,712 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 124 flow [2023-11-21 22:12:35,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-11-21 22:12:35,716 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-11-21 22:12:35,717 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 124 flow [2023-11-21 22:12:35,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2023-11-21 22:12:35,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:35,718 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] [2023-11-21 22:12:35,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:12:35,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:35,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1410217562, now seen corresponding path program 3 times [2023-11-21 22:12:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218089797] [2023-11-21 22:12:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218089797] [2023-11-21 22:12:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218089797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:36,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:12:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98072724] [2023-11-21 22:12:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:36,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:12:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:12:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:12:36,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2023-11-21 22:12:36,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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) [2023-11-21 22:12:36,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:12:36,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2023-11-21 22:12:36,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:12:36,570 INFO L124 PetriNetUnfolderBase]: 815/1499 cut-off events. [2023-11-21 22:12:36,570 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2023-11-21 22:12:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 1499 events. 815/1499 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7917 event pairs, 202 based on Foata normal form. 8/1459 useless extension candidates. Maximal degree in co-relation 3204. Up to 630 conditions per place. [2023-11-21 22:12:36,579 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 35 selfloop transitions, 9 changer transitions 18/78 dead transitions. [2023-11-21 22:12:36,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 346 flow [2023-11-21 22:12:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:12:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:12:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-21 22:12:36,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2023-11-21 22:12:36,581 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-21 22:12:36,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-21 22:12:36,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:12:36,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-21 22:12:36,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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) [2023-11-21 22:12:36,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 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) [2023-11-21 22:12:36,584 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 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) [2023-11-21 22:12:36,585 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 124 flow. Second operand 7 states and 154 transitions. [2023-11-21 22:12:36,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 346 flow [2023-11-21 22:12:36,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 324 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 22:12:36,591 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 179 flow [2023-11-21 22:12:36,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-11-21 22:12:36,593 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2023-11-21 22:12:36,593 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 179 flow [2023-11-21 22:12:36,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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) [2023-11-21 22:12:36,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:12:36,593 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] [2023-11-21 22:12:36,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:12:36,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 22:12:36,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -735130834, now seen corresponding path program 4 times [2023-11-21 22:12:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012417966] [2023-11-21 22:12:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:12:36,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:12:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:12:36,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:12:36,818 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:12:36,819 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-21 22:12:36,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-21 22:12:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-21 22:12:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-21 22:12:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-21 22:12:36,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-21 22:12:36,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:12:36,823 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-11-21 22:12:36,830 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:12:36,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:12:36,910 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:12:36,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:12:36,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:12:36,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:12:36 BasicIcfg [2023-11-21 22:12:36,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:12:36,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:12:36,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:12:36,972 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:12:36,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:29" (3/4) ... [2023-11-21 22:12:36,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 22:12:37,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:12:37,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:12:37,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:12:37,138 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:12:37,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:12:37,139 INFO L158 Benchmark]: Toolchain (without parser) took 9568.25ms. Allocated memory was 127.9MB in the beginning and 274.7MB in the end (delta: 146.8MB). Free memory was 95.5MB in the beginning and 145.0MB in the end (delta: -49.6MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,139 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 127.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:12:37,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.31ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 71.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.68ms. Allocated memory is still 127.9MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,142 INFO L158 Benchmark]: Boogie Preprocessor took 79.56ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 65.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,142 INFO L158 Benchmark]: RCFGBuilder took 947.28ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 65.7MB in the beginning and 115.2MB in the end (delta: -49.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,143 INFO L158 Benchmark]: TraceAbstraction took 7645.49ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 115.0MB in the beginning and 157.6MB in the end (delta: -42.6MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,143 INFO L158 Benchmark]: Witness Printer took 166.62ms. Allocated memory is still 274.7MB. Free memory was 157.6MB in the beginning and 145.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 22:12:37,146 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.31ms. Allocated memory is still 127.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.31ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 71.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.68ms. Allocated memory is still 127.9MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.56ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 65.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 947.28ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 65.7MB in the beginning and 115.2MB in the end (delta: -49.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7645.49ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 115.0MB in the beginning and 157.6MB in the end (delta: -42.6MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 166.62ms. Allocated memory is still 274.7MB. Free memory was 157.6MB in the beginning and 145.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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=2, y=1, 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: 848]: 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: 846]: 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: 844]: 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 7 procedures, 68 locations, 6 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: 7.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 15 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=7, InterpolantAutomatonStates: 39, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2023-11-21 22:12:37,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbc5afd-f434-4cb1-b68e-3aaf69338533/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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