./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB --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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:16:04,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:16:04,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:16:04,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:16:04,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:16:04,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:16:04,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:16:04,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:16:04,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:16:04,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:16:04,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:16:04,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:16:04,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:16:04,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:16:04,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:16:04,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:16:04,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:16:05,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:16:05,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:16:05,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:16:05,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:16:05,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:16:05,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:16:05,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:16:05,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:16:05,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:16:05,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:16:05,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:16:05,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:16:05,004 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-11-27 23:16:05,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:16:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:16:05,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:16:05,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:16:05,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:16:05,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-27 23:16:08,469 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/data/12ca707f6/a46f7ee3e48a4a6181e3e848cfcea9e6/FLAG512c3c691 [2024-11-27 23:16:09,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:16:09,015 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-27 23:16:09,069 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/data/12ca707f6/a46f7ee3e48a4a6181e3e848cfcea9e6/FLAG512c3c691 [2024-11-27 23:16:09,096 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/data/12ca707f6/a46f7ee3e48a4a6181e3e848cfcea9e6 [2024-11-27 23:16:09,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:16:09,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:16:09,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:16:09,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:16:09,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:16:09,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:16:09" (1/1) ... [2024-11-27 23:16:09,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e2b3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:09, skipping insertion in model container [2024-11-27 23:16:09,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:16:09" (1/1) ... [2024-11-27 23:16:09,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:16:09,922 WARN L250 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_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2024-11-27 23:16:09,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:16:09,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:16:10,098 WARN L250 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_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2024-11-27 23:16:10,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:16:10,195 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:16:10,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10 WrapperNode [2024-11-27 23:16:10,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:16:10,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:16:10,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:16:10,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:16:10,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,277 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-11-27 23:16:10,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:16:10,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:16:10,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:16:10,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:16:10,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,341 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-27 23:16:10,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:16:10,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:16:10,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:16:10,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:16:10,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (1/1) ... [2024-11-27 23:16:10,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:16:10,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:16:10,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:16:10,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:16:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-27 23:16:10,476 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-27 23:16:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 23:16:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:16:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:16:10,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:16:10,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:16:10,480 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 23:16:10,913 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:16:10,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:16:11,315 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 23:16:11,316 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:16:11,535 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:16:11,535 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:16:11,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:16:11 BoogieIcfgContainer [2024-11-27 23:16:11,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:16:11,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:16:11,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:16:11,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:16:11,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:16:09" (1/3) ... [2024-11-27 23:16:11,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7170525e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:16:11, skipping insertion in model container [2024-11-27 23:16:11,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:16:10" (2/3) ... [2024-11-27 23:16:11,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7170525e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:16:11, skipping insertion in model container [2024-11-27 23:16:11,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:16:11" (3/3) ... [2024-11-27 23:16:11,549 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-11-27 23:16:11,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:16:11,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 38 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2024-11-27 23:16:11,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 23:16:11,647 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-27 23:16:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2024-11-27 23:16:11,769 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2024-11-27 23:16:11,773 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 23:16:11,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 8/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2024-11-27 23:16:11,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2024-11-27 23:16:11,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2024-11-27 23:16:11,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:16:11,827 INFO L333 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, 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;@607819e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:16:11,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-27 23:16:11,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:16:11,846 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-11-27 23:16:11,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:16:11,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:11,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:11,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1544696618, now seen corresponding path program 1 times [2024-11-27 23:16:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635321426] [2024-11-27 23:16:11,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:16:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:16:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635321426] [2024-11-27 23:16:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635321426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:16:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015710667] [2024-11-27 23:16:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:16:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:12,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:16:12,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:16:12,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:12,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:12,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:12,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:13,376 INFO L124 PetriNetUnfolderBase]: 466/820 cut-off events. [2024-11-27 23:16:13,377 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-27 23:16:13,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 820 events. 466/820 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3460 event pairs, 345 based on Foata normal form. 2/819 useless extension candidates. Maximal degree in co-relation 1541. Up to 600 conditions per place. [2024-11-27 23:16:13,394 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-11-27 23:16:13,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2024-11-27 23:16:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:16:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:16:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-27 23:16:13,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-11-27 23:16:13,423 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2024-11-27 23:16:13,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2024-11-27 23:16:13,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-27 23:16:13,438 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2024-11-27 23:16:13,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-11-27 23:16:13,449 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2024-11-27 23:16:13,452 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2024-11-27 23:16:13,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:13,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:13,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:13,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:16:13,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1605291128, now seen corresponding path program 1 times [2024-11-27 23:16:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213239921] [2024-11-27 23:16:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:16:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:16:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213239921] [2024-11-27 23:16:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213239921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:16:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707636413] [2024-11-27 23:16:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:13,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:16:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:13,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:16:13,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:16:13,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:13,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:13,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:13,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:13,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:14,339 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-11-27 23:16:14,339 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-27 23:16:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1095 events. 602/1095 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5279 event pairs, 289 based on Foata normal form. 69/1163 useless extension candidates. Maximal degree in co-relation 819. Up to 574 conditions per place. [2024-11-27 23:16:14,354 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2024-11-27 23:16:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2024-11-27 23:16:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:16:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 23:16:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-27 23:16:14,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-11-27 23:16:14,358 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2024-11-27 23:16:14,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2024-11-27 23:16:14,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:16:14,363 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2024-11-27 23:16:14,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-11-27 23:16:14,364 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-27 23:16:14,367 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2024-11-27 23:16:14,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:14,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:14,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:16:14,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1671475294, now seen corresponding path program 1 times [2024-11-27 23:16:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217084056] [2024-11-27 23:16:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:16:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:16:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:14,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217084056] [2024-11-27 23:16:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217084056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:14,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:14,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:16:14,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506470649] [2024-11-27 23:16:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:14,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:16:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:14,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:16:14,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:16:14,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-27 23:16:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:14,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:14,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-27 23:16:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:14,865 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2024-11-27 23:16:14,866 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-27 23:16:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 404 events. 225/404 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1493 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 909. Up to 217 conditions per place. [2024-11-27 23:16:14,870 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-11-27 23:16:14,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2024-11-27 23:16:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:16:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 23:16:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-27 23:16:14,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-11-27 23:16:14,873 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2024-11-27 23:16:14,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2024-11-27 23:16:14,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:16:14,877 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2024-11-27 23:16:14,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-11-27 23:16:14,880 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2024-11-27 23:16:14,880 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2024-11-27 23:16:14,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:14,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:14,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:16:14,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash -897843709, now seen corresponding path program 1 times [2024-11-27 23:16:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886475219] [2024-11-27 23:16:14,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:16:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:16:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:16,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:16,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886475219] [2024-11-27 23:16:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886475219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:16,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:16,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:16:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784082194] [2024-11-27 23:16:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:16,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:16:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:16:16,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:16:16,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:16,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 74 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:16,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:16,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:16,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:17,874 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2024-11-27 23:16:17,874 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-11-27 23:16:17,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 718 events. 401/718 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3167 event pairs, 5 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 327. Up to 221 conditions per place. [2024-11-27 23:16:17,881 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-11-27 23:16:17,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2024-11-27 23:16:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:16:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-27 23:16:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2024-11-27 23:16:17,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2024-11-27 23:16:17,885 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2024-11-27 23:16:17,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2024-11-27 23:16:17,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:16:17,890 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2024-11-27 23:16:17,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-27 23:16:17,892 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-11-27 23:16:17,892 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2024-11-27 23:16:17,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:17,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:17,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:17,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:16:17,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1109055311, now seen corresponding path program 2 times [2024-11-27 23:16:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345392746] [2024-11-27 23:16:17,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:16:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:17,971 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:16:17,971 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345392746] [2024-11-27 23:16:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345392746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:16:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557481563] [2024-11-27 23:16:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:19,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:16:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:19,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:16:19,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:16:19,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:19,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 186 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:19,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:19,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:19,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:20,556 INFO L124 PetriNetUnfolderBase]: 587/1090 cut-off events. [2024-11-27 23:16:20,557 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2024-11-27 23:16:20,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 1090 events. 587/1090 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5389 event pairs, 14 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 2966. Up to 271 conditions per place. [2024-11-27 23:16:20,566 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 88 selfloop transitions, 37 changer transitions 0/127 dead transitions. [2024-11-27 23:16:20,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 127 transitions, 734 flow [2024-11-27 23:16:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:16:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-27 23:16:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2024-11-27 23:16:20,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2024-11-27 23:16:20,575 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 15 states and 229 transitions. [2024-11-27 23:16:20,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 127 transitions, 734 flow [2024-11-27 23:16:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 127 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:16:20,582 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 427 flow [2024-11-27 23:16:20,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=427, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-11-27 23:16:20,583 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2024-11-27 23:16:20,583 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 427 flow [2024-11-27 23:16:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:20,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:20,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:20,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:16:20,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -316558351, now seen corresponding path program 3 times [2024-11-27 23:16:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707052364] [2024-11-27 23:16:20,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:16:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:20,626 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:16:20,626 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707052364] [2024-11-27 23:16:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707052364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:16:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326524516] [2024-11-27 23:16:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:16:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:21,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:16:21,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:16:21,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:21,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 427 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:21,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:21,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:21,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:22,691 INFO L124 PetriNetUnfolderBase]: 768/1433 cut-off events. [2024-11-27 23:16:22,691 INFO L125 PetriNetUnfolderBase]: For 2618/2618 co-relation queries the response was YES. [2024-11-27 23:16:22,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 1433 events. 768/1433 cut-off events. For 2618/2618 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7699 event pairs, 115 based on Foata normal form. 1/1434 useless extension candidates. Maximal degree in co-relation 4513. Up to 365 conditions per place. [2024-11-27 23:16:22,703 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 102 selfloop transitions, 39 changer transitions 0/143 dead transitions. [2024-11-27 23:16:22,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 1076 flow [2024-11-27 23:16:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:16:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-27 23:16:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 230 transitions. [2024-11-27 23:16:22,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2024-11-27 23:16:22,706 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 427 flow. Second operand 15 states and 230 transitions. [2024-11-27 23:16:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 1076 flow [2024-11-27 23:16:22,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 143 transitions, 1038 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-27 23:16:22,729 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 663 flow [2024-11-27 23:16:22,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=663, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2024-11-27 23:16:22,730 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-27 23:16:22,730 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 663 flow [2024-11-27 23:16:22,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:22,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:22,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:16:22,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:16:22,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1104788379, now seen corresponding path program 4 times [2024-11-27 23:16:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158688876] [2024-11-27 23:16:22,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:16:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:22,772 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:16:22,772 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:23,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158688876] [2024-11-27 23:16:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158688876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:16:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996652356] [2024-11-27 23:16:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:16:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:23,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:16:23,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:16:23,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:23,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 663 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:23,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:23,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:24,735 INFO L124 PetriNetUnfolderBase]: 768/1431 cut-off events. [2024-11-27 23:16:24,736 INFO L125 PetriNetUnfolderBase]: For 3700/3700 co-relation queries the response was YES. [2024-11-27 23:16:24,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4895 conditions, 1431 events. 768/1431 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7622 event pairs, 38 based on Foata normal form. 1/1432 useless extension candidates. Maximal degree in co-relation 4851. Up to 365 conditions per place. [2024-11-27 23:16:24,750 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 100 selfloop transitions, 53 changer transitions 0/154 dead transitions. [2024-11-27 23:16:24,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 154 transitions, 1260 flow [2024-11-27 23:16:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 23:16:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-27 23:16:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 258 transitions. [2024-11-27 23:16:24,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2024-11-27 23:16:24,754 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 663 flow. Second operand 17 states and 258 transitions. [2024-11-27 23:16:24,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 154 transitions, 1260 flow [2024-11-27 23:16:24,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 1197 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-11-27 23:16:24,780 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 825 flow [2024-11-27 23:16:24,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=825, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2024-11-27 23:16:24,783 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-11-27 23:16:24,783 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 825 flow [2024-11-27 23:16:24,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 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) [2024-11-27 23:16:24,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:24,785 INFO L206 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] [2024-11-27 23:16:24,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:16:24,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:24,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1930621198, now seen corresponding path program 1 times [2024-11-27 23:16:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227237854] [2024-11-27 23:16:24,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:16:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:16:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227237854] [2024-11-27 23:16:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227237854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:16:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993798060] [2024-11-27 23:16:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:16:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:26,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:16:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:16:26,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:26,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 825 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:26,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:26,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:27,665 INFO L124 PetriNetUnfolderBase]: 956/1779 cut-off events. [2024-11-27 23:16:27,666 INFO L125 PetriNetUnfolderBase]: For 8004/8004 co-relation queries the response was YES. [2024-11-27 23:16:27,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 1779 events. 956/1779 cut-off events. For 8004/8004 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10038 event pairs, 308 based on Foata normal form. 1/1780 useless extension candidates. Maximal degree in co-relation 6465. Up to 1246 conditions per place. [2024-11-27 23:16:27,685 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 74 selfloop transitions, 59 changer transitions 45/179 dead transitions. [2024-11-27 23:16:27,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 179 transitions, 1989 flow [2024-11-27 23:16:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 23:16:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-27 23:16:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2024-11-27 23:16:27,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-11-27 23:16:27,691 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 825 flow. Second operand 18 states and 250 transitions. [2024-11-27 23:16:27,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 179 transitions, 1989 flow [2024-11-27 23:16:27,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 179 transitions, 1889 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-11-27 23:16:27,752 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 1432 flow [2024-11-27 23:16:27,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1432, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2024-11-27 23:16:27,754 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 73 predicate places. [2024-11-27 23:16:27,756 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1432 flow [2024-11-27 23:16:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:27,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:27,756 INFO L206 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] [2024-11-27 23:16:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:16:27,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1330315432, now seen corresponding path program 2 times [2024-11-27 23:16:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980654330] [2024-11-27 23:16:27,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:16:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:27,818 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:16:27,818 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980654330] [2024-11-27 23:16:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980654330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:16:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24955295] [2024-11-27 23:16:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:16:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:29,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:16:29,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:16:29,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:29,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1432 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:29,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:29,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:29,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:30,951 INFO L124 PetriNetUnfolderBase]: 1087/2058 cut-off events. [2024-11-27 23:16:30,952 INFO L125 PetriNetUnfolderBase]: For 11070/11070 co-relation queries the response was YES. [2024-11-27 23:16:30,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9157 conditions, 2058 events. 1087/2058 cut-off events. For 11070/11070 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12293 event pairs, 413 based on Foata normal form. 2/2060 useless extension candidates. Maximal degree in co-relation 9088. Up to 1450 conditions per place. [2024-11-27 23:16:30,976 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 124 selfloop transitions, 69 changer transitions 34/228 dead transitions. [2024-11-27 23:16:30,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 228 transitions, 2875 flow [2024-11-27 23:16:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-27 23:16:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-27 23:16:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2024-11-27 23:16:30,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2024-11-27 23:16:30,979 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1432 flow. Second operand 19 states and 277 transitions. [2024-11-27 23:16:30,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 228 transitions, 2875 flow [2024-11-27 23:16:31,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 228 transitions, 2708 flow, removed 62 selfloop flow, removed 11 redundant places. [2024-11-27 23:16:31,124 INFO L231 Difference]: Finished difference. Result has 124 places, 146 transitions, 1923 flow [2024-11-27 23:16:31,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1923, PETRI_PLACES=124, PETRI_TRANSITIONS=146} [2024-11-27 23:16:31,125 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 79 predicate places. [2024-11-27 23:16:31,128 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 146 transitions, 1923 flow [2024-11-27 23:16:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:31,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:31,129 INFO L206 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] [2024-11-27 23:16:31,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:16:31,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:31,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1424521552, now seen corresponding path program 3 times [2024-11-27 23:16:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845817832] [2024-11-27 23:16:31,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:16:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:31,173 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:16:31,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845817832] [2024-11-27 23:16:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845817832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:32,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:32,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:16:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11634065] [2024-11-27 23:16:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:32,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:16:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:32,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:16:32,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:16:32,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:32,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 1923 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:32,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:32,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:32,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:34,641 INFO L124 PetriNetUnfolderBase]: 1207/2328 cut-off events. [2024-11-27 23:16:34,641 INFO L125 PetriNetUnfolderBase]: For 12927/12927 co-relation queries the response was YES. [2024-11-27 23:16:34,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10443 conditions, 2328 events. 1207/2328 cut-off events. For 12927/12927 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14440 event pairs, 409 based on Foata normal form. 2/2330 useless extension candidates. Maximal degree in co-relation 10362. Up to 1384 conditions per place. [2024-11-27 23:16:34,670 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 136 selfloop transitions, 94 changer transitions 36/267 dead transitions. [2024-11-27 23:16:34,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 267 transitions, 3419 flow [2024-11-27 23:16:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 23:16:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-27 23:16:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2024-11-27 23:16:34,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2024-11-27 23:16:34,678 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 1923 flow. Second operand 23 states and 325 transitions. [2024-11-27 23:16:34,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 267 transitions, 3419 flow [2024-11-27 23:16:34,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 267 transitions, 3285 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-11-27 23:16:34,792 INFO L231 Difference]: Finished difference. Result has 149 places, 175 transitions, 2537 flow [2024-11-27 23:16:34,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2537, PETRI_PLACES=149, PETRI_TRANSITIONS=175} [2024-11-27 23:16:34,793 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places. [2024-11-27 23:16:34,795 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 175 transitions, 2537 flow [2024-11-27 23:16:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:34,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:34,795 INFO L206 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] [2024-11-27 23:16:34,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:16:34,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:34,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1477559780, now seen corresponding path program 4 times [2024-11-27 23:16:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:34,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290450561] [2024-11-27 23:16:34,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:16:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:34,843 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:16:34,843 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:16:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:16:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:16:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290450561] [2024-11-27 23:16:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290450561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:16:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:16:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:16:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549112873] [2024-11-27 23:16:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:36,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:16:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:36,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:16:36,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:16:36,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2024-11-27 23:16:36,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 175 transitions, 2537 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:16:36,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2024-11-27 23:16:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:16:37,882 INFO L124 PetriNetUnfolderBase]: 1211/2394 cut-off events. [2024-11-27 23:16:37,882 INFO L125 PetriNetUnfolderBase]: For 15349/15349 co-relation queries the response was YES. [2024-11-27 23:16:37,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 2394 events. 1211/2394 cut-off events. For 15349/15349 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15362 event pairs, 514 based on Foata normal form. 1/2395 useless extension candidates. Maximal degree in co-relation 11380. Up to 1696 conditions per place. [2024-11-27 23:16:37,924 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 146 selfloop transitions, 84 changer transitions 35/266 dead transitions. [2024-11-27 23:16:37,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 266 transitions, 3761 flow [2024-11-27 23:16:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 23:16:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-27 23:16:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 265 transitions. [2024-11-27 23:16:37,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2024-11-27 23:16:37,928 INFO L175 Difference]: Start difference. First operand has 149 places, 175 transitions, 2537 flow. Second operand 18 states and 265 transitions. [2024-11-27 23:16:37,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 266 transitions, 3761 flow [2024-11-27 23:16:38,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 266 transitions, 3692 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-27 23:16:38,102 INFO L231 Difference]: Finished difference. Result has 163 places, 191 transitions, 2955 flow [2024-11-27 23:16:38,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2955, PETRI_PLACES=163, PETRI_TRANSITIONS=191} [2024-11-27 23:16:38,104 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 118 predicate places. [2024-11-27 23:16:38,104 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 191 transitions, 2955 flow [2024-11-27 23:16:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:16:38,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:16:38,104 INFO L206 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] [2024-11-27 23:16:38,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:16:38,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-27 23:16:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:16:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2038051846, now seen corresponding path program 5 times [2024-11-27 23:16:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:16:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291729459] [2024-11-27 23:16:38,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:16:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:16:38,166 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:16:38,166 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 23:16:38,166 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:16:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:16:38,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:16:38,244 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:16:38,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-27 23:16:38,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-27 23:16:38,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-27 23:16:38,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-27 23:16:38,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-27 23:16:38,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-27 23:16:38,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:16:38,249 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1] [2024-11-27 23:16:38,334 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 23:16:38,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:16:38,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:16:38 BasicIcfg [2024-11-27 23:16:38,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:16:38,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:16:38,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:16:38,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:16:38,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:16:11" (3/4) ... [2024-11-27 23:16:38,346 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:16:38,452 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 15. [2024-11-27 23:16:38,536 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:16:38,536 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:16:38,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:16:38,540 INFO L158 Benchmark]: Toolchain (without parser) took 29438.01ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 89.3MB in the beginning and 295.0MB in the end (delta: -205.7MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,540 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:16:38,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1092.44ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 58.1MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.45ms. Allocated memory is still 117.4MB. Free memory was 58.1MB in the beginning and 55.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:16:38,541 INFO L158 Benchmark]: Boogie Preprocessor took 103.10ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 52.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,542 INFO L158 Benchmark]: RCFGBuilder took 1154.39ms. Allocated memory is still 117.4MB. Free memory was 52.6MB in the beginning and 70.5MB in the end (delta: -17.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,542 INFO L158 Benchmark]: TraceAbstraction took 26804.34ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 70.0MB in the beginning and 303.3MB in the end (delta: -233.3MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,543 INFO L158 Benchmark]: Witness Printer took 195.31ms. Allocated memory is still 478.2MB. Free memory was 303.3MB in the beginning and 295.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:16:38,545 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.59ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1092.44ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 58.1MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.45ms. Allocated memory is still 117.4MB. Free memory was 58.1MB in the beginning and 55.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.10ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 52.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1154.39ms. Allocated memory is still 117.4MB. Free memory was 52.6MB in the beginning and 70.5MB in the end (delta: -17.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26804.34ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 70.0MB in the beginning and 303.3MB in the end (delta: -233.3MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 195.31ms. Allocated memory is still 478.2MB. Free memory was 303.3MB in the beginning and 295.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 2 return 0; [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: 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: 3887]: 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: 3887]: 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: 3930]: 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: 3931]: 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 4 procedures, 52 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: 26.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1247 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1187 mSDsluCounter, 1205 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1135 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4673 IncrementalHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 70 mSDtfsCounter, 4673 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2955occurred in iteration=11, InterpolantAutomatonStates: 149, 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.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:16:38,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ef34ee5-b5f9-4244-9b9d-2f5ab0d30dfa/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE