./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.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_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/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_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/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_e99e7f30-de3e-419f-8885-b38416c0b284/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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:27,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:27,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:29:27,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:27,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:27,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:27,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:27,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:27,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:27,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:27,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:27,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:27,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:27,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:27,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:27,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:27,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:29:27,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:27,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:27,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:27,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:27,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:29:27,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:27,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:29:27,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:27,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:29:27,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:27,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:27,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:27,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:27,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:27,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:27,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:27,483 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_e99e7f30-de3e-419f-8885-b38416c0b284/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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-11-28 03:29:27,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:27,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:27,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:27,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:27,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:27,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-28 03:29:31,018 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/data/223b4df54/32c58cd8170047fa9c2a97d59155db77/FLAG4b5fa2fee [2024-11-28 03:29:31,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:31,542 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-28 03:29:31,591 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/data/223b4df54/32c58cd8170047fa9c2a97d59155db77/FLAG4b5fa2fee [2024-11-28 03:29:31,621 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/data/223b4df54/32c58cd8170047fa9c2a97d59155db77 [2024-11-28 03:29:31,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:31,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:31,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:31,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:31,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:31,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:31" (1/1) ... [2024-11-28 03:29:31,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a503f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:31, skipping insertion in model container [2024-11-28 03:29:31,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:31" (1/1) ... [2024-11-28 03:29:31,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:32,155 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_e99e7f30-de3e-419f-8885-b38416c0b284/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-11-28 03:29:32,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:32,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:32,322 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_e99e7f30-de3e-419f-8885-b38416c0b284/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-11-28 03:29:32,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:32,408 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:32,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32 WrapperNode [2024-11-28 03:29:32,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:32,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:32,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:32,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:32,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,461 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-11-28 03:29:32,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:32,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:32,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:32,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:32,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,501 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 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, 6, 2]. [2024-11-28 03:29:32,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:32,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:32,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:32,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:32,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (1/1) ... [2024-11-28 03:29:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:32,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:32,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:29:32,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:29:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-28 03:29:32,628 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-28 03:29:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:29:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:29:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:29:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:29:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:29:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:29:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:29:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:29:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:29:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:29:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:32,634 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:29:32,956 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:32,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:33,296 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:29:33,296 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:33,541 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:33,541 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:29:33,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:33 BoogieIcfgContainer [2024-11-28 03:29:33,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:33,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:33,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:33,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:33,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:31" (1/3) ... [2024-11-28 03:29:33,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79135d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:33, skipping insertion in model container [2024-11-28 03:29:33,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:32" (2/3) ... [2024-11-28 03:29:33,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79135d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:33, skipping insertion in model container [2024-11-28 03:29:33,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:33" (3/3) ... [2024-11-28 03:29:33,556 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-11-28 03:29:33,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:33,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2024-11-28 03:29:33,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:29:33,652 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:29:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-11-28 03:29:33,769 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-11-28 03:29:33,772 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:29:33,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2024-11-28 03:29:33,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-11-28 03:29:33,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-11-28 03:29:33,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:33,814 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;@5dabd656, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:33,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-28 03:29:33,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:29:33,820 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-11-28 03:29:33,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:29:33,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:33,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 03:29:33,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:33,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 12997494, now seen corresponding path program 1 times [2024-11-28 03:29:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073557783] [2024-11-28 03:29:33,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:34,587 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-28 03:29:34,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073557783] [2024-11-28 03:29:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073557783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:34,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814739258] [2024-11-28 03:29:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:34,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:34,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:34,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:34,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-28 03:29:34,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:34,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:34,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:35,163 INFO L124 PetriNetUnfolderBase]: 466/824 cut-off events. [2024-11-28 03:29:35,163 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-28 03:29:35,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 824 events. 466/824 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3433 event pairs, 345 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 1539. Up to 602 conditions per place. [2024-11-28 03:29:35,178 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-11-28 03:29:35,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-11-28 03:29:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:29:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-28 03:29:35,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-28 03:29:35,204 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2024-11-28 03:29:35,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2024-11-28 03:29:35,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:29:35,218 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2024-11-28 03:29:35,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-11-28 03:29:35,228 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-11-28 03:29:35,228 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2024-11-28 03:29:35,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-28 03:29:35,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:35,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:35,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:29:35,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:35,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash -394243086, now seen corresponding path program 1 times [2024-11-28 03:29:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645724100] [2024-11-28 03:29:35,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:35,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:35,539 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-28 03:29:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645724100] [2024-11-28 03:29:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645724100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457882773] [2024-11-28 03:29:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:35,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:35,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:35,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:35,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:35,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-28 03:29:35,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:35,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:35,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:35,983 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2024-11-28 03:29:35,983 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-28 03:29:35,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 811 events. 466/811 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3345 event pairs, 199 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 813. Up to 578 conditions per place. [2024-11-28 03:29:35,998 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2024-11-28 03:29:35,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2024-11-28 03:29:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:29:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:29:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-11-28 03:29:36,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2024-11-28 03:29:36,003 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-11-28 03:29:36,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2024-11-28 03:29:36,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:36,009 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2024-11-28 03:29:36,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-11-28 03:29:36,011 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-28 03:29:36,011 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2024-11-28 03:29:36,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-28 03:29:36,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:36,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:36,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:29:36,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:36,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 959577463, now seen corresponding path program 1 times [2024-11-28 03:29:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:36,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515342571] [2024-11-28 03:29:36,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:36,471 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-28 03:29:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515342571] [2024-11-28 03:29:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515342571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:36,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:36,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34497399] [2024-11-28 03:29:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:36,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:36,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:36,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:36,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:36,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:36,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:36,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:36,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:37,011 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-11-28 03:29:37,011 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-28 03:29:37,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1095 events. 602/1095 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5228 event pairs, 251 based on Foata normal form. 69/1163 useless extension candidates. Maximal degree in co-relation 332. Up to 575 conditions per place. [2024-11-28 03:29:37,021 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2024-11-28 03:29:37,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2024-11-28 03:29:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:29:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-28 03:29:37,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-11-28 03:29:37,024 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2024-11-28 03:29:37,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2024-11-28 03:29:37,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:29:37,030 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2024-11-28 03:29:37,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-11-28 03:29:37,032 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-28 03:29:37,032 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2024-11-28 03:29:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:37,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:37,032 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] [2024-11-28 03:29:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:29:37,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1835591283, now seen corresponding path program 1 times [2024-11-28 03:29:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162885508] [2024-11-28 03:29:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:37,251 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-28 03:29:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162885508] [2024-11-28 03:29:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162885508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:37,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755266025] [2024-11-28 03:29:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:37,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:37,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-11-28 03:29:37,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:37,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:37,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-11-28 03:29:37,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:37,527 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2024-11-28 03:29:37,528 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-28 03:29:37,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 408 events. 225/408 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1458 event pairs, 39 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 983. Up to 217 conditions per place. [2024-11-28 03:29:37,532 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-28 03:29:37,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2024-11-28 03:29:37,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:29:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-11-28 03:29:37,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-11-28 03:29:37,537 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2024-11-28 03:29:37,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2024-11-28 03:29:37,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:29:37,542 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2024-11-28 03:29:37,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-11-28 03:29:37,543 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2024-11-28 03:29:37,543 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2024-11-28 03:29:37,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:37,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:37,545 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, 1, 1] [2024-11-28 03:29:37,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:29:37,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -640282583, now seen corresponding path program 1 times [2024-11-28 03:29:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:37,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879567569] [2024-11-28 03:29:37,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:38,627 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-28 03:29:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879567569] [2024-11-28 03:29:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879567569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:29:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349075978] [2024-11-28 03:29:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:29:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:38,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:29:38,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:38,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:38,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-28 03:29:38,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:38,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:38,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:39,247 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-11-28 03:29:39,247 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-28 03:29:39,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 492 events. 263/492 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1813 event pairs, 19 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 280. Up to 147 conditions per place. [2024-11-28 03:29:39,251 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2024-11-28 03:29:39,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2024-11-28 03:29:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:29:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:29:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-11-28 03:29:39,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2024-11-28 03:29:39,254 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2024-11-28 03:29:39,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2024-11-28 03:29:39,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:29:39,258 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2024-11-28 03:29:39,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=207, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-11-28 03:29:39,259 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-11-28 03:29:39,259 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2024-11-28 03:29:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-28 03:29:39,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:39,259 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, 1, 1] [2024-11-28 03:29:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:29:39,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1263566219, now seen corresponding path program 2 times [2024-11-28 03:29:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909174426] [2024-11-28 03:29:39,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:29:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:39,323 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:29:39,323 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:40,768 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-28 03:29:40,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909174426] [2024-11-28 03:29:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909174426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:40,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:29:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340479043] [2024-11-28 03:29:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:40,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:29:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:40,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:29:40,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:40,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:40,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 207 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-28 03:29:40,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:40,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:40,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:41,751 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2024-11-28 03:29:41,752 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2024-11-28 03:29:41,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 860 events. 447/860 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4103 event pairs, 33 based on Foata normal form. 2/862 useless extension candidates. Maximal degree in co-relation 2452. Up to 186 conditions per place. [2024-11-28 03:29:41,758 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2024-11-28 03:29:41,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2024-11-28 03:29:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:29:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-28 03:29:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2024-11-28 03:29:41,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2024-11-28 03:29:41,761 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2024-11-28 03:29:41,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2024-11-28 03:29:41,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:29:41,771 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2024-11-28 03:29:41,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=451, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-11-28 03:29:41,772 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-11-28 03:29:41,773 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2024-11-28 03:29:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-28 03:29:41,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:41,773 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, 1, 1] [2024-11-28 03:29:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:29:41,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 916898611, now seen corresponding path program 3 times [2024-11-28 03:29:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348984185] [2024-11-28 03:29:41,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:29:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:41,823 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:29:41,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:42,741 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-28 03:29:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348984185] [2024-11-28 03:29:42,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348984185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:29:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597670849] [2024-11-28 03:29:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:42,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:29:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:29:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:29:42,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:42,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-28 03:29:42,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:42,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:42,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:43,957 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2024-11-28 03:29:43,958 INFO L125 PetriNetUnfolderBase]: For 2981/2981 co-relation queries the response was YES. [2024-11-28 03:29:43,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1279 events. 662/1279 cut-off events. For 2981/2981 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6752 event pairs, 61 based on Foata normal form. 1/1280 useless extension candidates. Maximal degree in co-relation 4209. Up to 277 conditions per place. [2024-11-28 03:29:43,969 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-11-28 03:29:43,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2024-11-28 03:29:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:29:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-28 03:29:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2024-11-28 03:29:43,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2024-11-28 03:29:43,972 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2024-11-28 03:29:43,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2024-11-28 03:29:43,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:29:43,994 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2024-11-28 03:29:43,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=813, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-11-28 03:29:43,995 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-11-28 03:29:43,996 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2024-11-28 03:29:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-28 03:29:43,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:43,996 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, 1, 1] [2024-11-28 03:29:43,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:29:43,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash 259965645, now seen corresponding path program 4 times [2024-11-28 03:29:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102850888] [2024-11-28 03:29:43,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:29:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:44,041 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:29:44,042 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:44,856 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-28 03:29:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102850888] [2024-11-28 03:29:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102850888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:29:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065387286] [2024-11-28 03:29:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:29:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:44,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:29:44,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:29:44,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:44,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 813 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-28 03:29:44,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:44,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:45,961 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2024-11-28 03:29:45,962 INFO L125 PetriNetUnfolderBase]: For 5019/5019 co-relation queries the response was YES. [2024-11-28 03:29:45,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1277 events. 662/1277 cut-off events. For 5019/5019 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6773 event pairs, 71 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 4663. Up to 417 conditions per place. [2024-11-28 03:29:45,976 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2024-11-28 03:29:45,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2024-11-28 03:29:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:29:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-28 03:29:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2024-11-28 03:29:45,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2024-11-28 03:29:45,979 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2024-11-28 03:29:45,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2024-11-28 03:29:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-11-28 03:29:46,020 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2024-11-28 03:29:46,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1007, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2024-11-28 03:29:46,023 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-11-28 03:29:46,023 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2024-11-28 03:29:46,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-28 03:29:46,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:46,024 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, 1, 1, 1, 1] [2024-11-28 03:29:46,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:29:46,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1799234892, now seen corresponding path program 1 times [2024-11-28 03:29:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899091195] [2024-11-28 03:29:46,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:47,693 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-28 03:29:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899091195] [2024-11-28 03:29:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899091195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:47,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:47,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:29:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877078272] [2024-11-28 03:29:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:47,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:47,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:47,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:47,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 1007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:47,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:47,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:49,239 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2024-11-28 03:29:49,239 INFO L125 PetriNetUnfolderBase]: For 8525/8525 co-relation queries the response was YES. [2024-11-28 03:29:49,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1579 events. 826/1579 cut-off events. For 8525/8525 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8762 event pairs, 258 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 5535. Up to 966 conditions per place. [2024-11-28 03:29:49,253 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2024-11-28 03:29:49,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2024-11-28 03:29:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:29:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-28 03:29:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2024-11-28 03:29:49,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2024-11-28 03:29:49,258 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2024-11-28 03:29:49,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2024-11-28 03:29:49,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-28 03:29:49,307 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2024-11-28 03:29:49,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1639, PETRI_PLACES=117, PETRI_TRANSITIONS=135} [2024-11-28 03:29:49,309 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-11-28 03:29:49,310 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2024-11-28 03:29:49,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:49,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:49,310 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, 1, 1, 1, 1] [2024-11-28 03:29:49,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:29:49,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash 752657800, now seen corresponding path program 2 times [2024-11-28 03:29:49,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308229746] [2024-11-28 03:29:49,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:29:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:49,364 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:29:49,366 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:50,729 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-28 03:29:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308229746] [2024-11-28 03:29:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308229746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:50,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:29:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977876295] [2024-11-28 03:29:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:50,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:50,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:50,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:50,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 135 transitions, 1639 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:50,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:50,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:52,684 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2024-11-28 03:29:52,684 INFO L125 PetriNetUnfolderBase]: For 11882/11882 co-relation queries the response was YES. [2024-11-28 03:29:52,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1824 events. 935/1824 cut-off events. For 11882/11882 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10813 event pairs, 330 based on Foata normal form. 2/1826 useless extension candidates. Maximal degree in co-relation 8081. Up to 1234 conditions per place. [2024-11-28 03:29:52,708 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2024-11-28 03:29:52,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2024-11-28 03:29:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 03:29:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-28 03:29:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2024-11-28 03:29:52,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2024-11-28 03:29:52,715 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2024-11-28 03:29:52,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2024-11-28 03:29:52,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2024-11-28 03:29:52,794 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2024-11-28 03:29:52,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2184, PETRI_PLACES=137, PETRI_TRANSITIONS=170} [2024-11-28 03:29:52,797 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2024-11-28 03:29:52,797 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2024-11-28 03:29:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:52,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:52,799 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, 1, 1, 1, 1] [2024-11-28 03:29:52,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:29:52,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:52,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1629587922, now seen corresponding path program 3 times [2024-11-28 03:29:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919097015] [2024-11-28 03:29:52,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:29:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:52,860 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:29:52,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:54,230 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-28 03:29:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919097015] [2024-11-28 03:29:54,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919097015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:54,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:29:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715781814] [2024-11-28 03:29:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:54,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:54,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-11-28 03:29:54,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 2184 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:54,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:29:54,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-11-28 03:29:54,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:29:56,306 INFO L124 PetriNetUnfolderBase]: 887/1770 cut-off events. [2024-11-28 03:29:56,306 INFO L125 PetriNetUnfolderBase]: For 12424/12424 co-relation queries the response was YES. [2024-11-28 03:29:56,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8156 conditions, 1770 events. 887/1770 cut-off events. For 12424/12424 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10539 event pairs, 305 based on Foata normal form. 2/1772 useless extension candidates. Maximal degree in co-relation 8099. Up to 1002 conditions per place. [2024-11-28 03:29:56,329 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 136 selfloop transitions, 90 changer transitions 31/258 dead transitions. [2024-11-28 03:29:56,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 258 transitions, 3395 flow [2024-11-28 03:29:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:29:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-28 03:29:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 370 transitions. [2024-11-28 03:29:56,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26811594202898553 [2024-11-28 03:29:56,336 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 23 states and 370 transitions. [2024-11-28 03:29:56,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 258 transitions, 3395 flow [2024-11-28 03:29:56,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 3178 flow, removed 51 selfloop flow, removed 12 redundant places. [2024-11-28 03:29:56,436 INFO L231 Difference]: Finished difference. Result has 151 places, 177 transitions, 2403 flow [2024-11-28 03:29:56,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2403, PETRI_PLACES=151, PETRI_TRANSITIONS=177} [2024-11-28 03:29:56,439 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-11-28 03:29:56,440 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 177 transitions, 2403 flow [2024-11-28 03:29:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-28 03:29:56,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:29:56,440 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, 1, 1, 1, 1] [2024-11-28 03:29:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:29:56,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-11-28 03:29:56,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash 716253294, now seen corresponding path program 4 times [2024-11-28 03:29:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623047708] [2024-11-28 03:29:56,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:29:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:56,511 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:29:56,513 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:29:56,514 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:29:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:56,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:29:56,600 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:29:56,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-11-28 03:29:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-11-28 03:29:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-11-28 03:29:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-11-28 03:29:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-11-28 03:29:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-11-28 03:29:56,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-28 03:29:56,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-11-28 03:29:56,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:29:56,604 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2024-11-28 03:29:56,697 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:29:56,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:29:56,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:29:56 BasicIcfg [2024-11-28 03:29:56,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:29:56,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:29:56,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:29:56,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:29:56,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:33" (3/4) ... [2024-11-28 03:29:56,712 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:29:56,807 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 21. [2024-11-28 03:29:56,908 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:29:56,909 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:29:56,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:29:56,910 INFO L158 Benchmark]: Toolchain (without parser) took 25284.71ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 102.5MB in the beginning and 214.4MB in the end (delta: -112.0MB). Peak memory consumption was 279.2MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,910 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 167.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:56,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.71ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 69.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:56,911 INFO L158 Benchmark]: Boogie Preprocessor took 66.85ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,911 INFO L158 Benchmark]: RCFGBuilder took 1012.56ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 95.7MB in the end (delta: -30.2MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,913 INFO L158 Benchmark]: TraceAbstraction took 23164.77ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 95.1MB in the beginning and 227.0MB in the end (delta: -132.0MB). Peak memory consumption was 262.7MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,913 INFO L158 Benchmark]: Witness Printer took 198.94ms. Allocated memory is still 536.9MB. Free memory was 227.0MB in the beginning and 214.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:56,917 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.48ms. Allocated memory is still 167.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.71ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 69.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.85ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.56ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 95.7MB in the end (delta: -30.2MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23164.77ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 95.1MB in the beginning and 227.0MB in the end (delta: -132.0MB). Peak memory consumption was 262.7MB. Max. memory is 16.1GB. * Witness Printer took 198.94ms. Allocated memory is still 536.9MB. Free memory was 227.0MB in the beginning and 214.4MB in the end (delta: 12.6MB). 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; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=0] [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3935] 0 return 0; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result=0, data={5:0}, my_dev={5:24}, res=0, t1=-2, t2=-1] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 1 return 0; [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3917] 2 return 0; [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-2, t2=-1] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, data={5:0}, expression=1, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] [L3887] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-2, t2=-1] - 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: 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: 3933]: 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: 3934]: 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, 60 locations, 8 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: 22.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1360 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1280 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1220 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4191 IncrementalHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 33 mSDtfsCounter, 4191 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2403occurred in iteration=11, InterpolantAutomatonStates: 141, 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, 9.8s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2682 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-28 03:29:56,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e99e7f30-de3e-419f-8885-b38416c0b284/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