./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 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/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_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU --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.2.5-dev-4fc63b2 [2024-10-31 22:00:44,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:44,535 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:00:44,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:44,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:44,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:44,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:44,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:44,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:44,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:44,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:44,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:44,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:44,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:44,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:44,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:44,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:44,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:44,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:00:44,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:44,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:44,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:44,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:44,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:44,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:44,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:44,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:44,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:44,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:44,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:44,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:44,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:44,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:44,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:44,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:44,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:44,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:00:44,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:00:44,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:44,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:44,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:44,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:44,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU 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-10-31 22:00:44,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:44,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:44,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:44,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:44,960 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:44,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i Unable to find full path for "g++" [2024-10-31 22:00:47,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:47,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:47,374 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-10-31 22:00:47,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/data/5a5f59291/db41223a250b408784d7437ce98b9639/FLAG8905b2c8d [2024-10-31 22:00:47,448 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/data/5a5f59291/db41223a250b408784d7437ce98b9639 [2024-10-31 22:00:47,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:47,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:47,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:47,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:47,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:47,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:47" (1/1) ... [2024-10-31 22:00:47,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be40f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:47, skipping insertion in model container [2024-10-31 22:00:47,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:47" (1/1) ... [2024-10-31 22:00:47,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:48,089 WARN L251 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_ed015def-c5cc-4c0b-bba0-be1d09100fdd/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-10-31 22:00:48,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:48,147 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:48,211 WARN L251 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_ed015def-c5cc-4c0b-bba0-be1d09100fdd/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-10-31 22:00:48,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:48,288 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:48,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48 WrapperNode [2024-10-31 22:00:48,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:48,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:48,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:48,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:48,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,380 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-10-31 22:00:48,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:48,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:48,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:48,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:48,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,441 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-10-31 22:00:48,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:48,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:48,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:48,494 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:48,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (1/1) ... [2024-10-31 22:00:48,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:48,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:48,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:48,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-31 22:00:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-31 22:00:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:00:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:00:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:00:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:00:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:00:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:00:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:00:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:00:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:00:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:00:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:00:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:48,582 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:00:48,942 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:48,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:49,283 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:00:49,283 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:49,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:49,453 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:00:49,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:49 BoogieIcfgContainer [2024-10-31 22:00:49,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:49,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:49,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:49,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:49,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:47" (1/3) ... [2024-10-31 22:00:49,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca7d6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:49, skipping insertion in model container [2024-10-31 22:00:49,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:48" (2/3) ... [2024-10-31 22:00:49,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca7d6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:49, skipping insertion in model container [2024-10-31 22:00:49,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:49" (3/3) ... [2024-10-31 22:00:49,464 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-10-31 22:00:49,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:49,486 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-31 22:00:49,486 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:00:49,556 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:00:49,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-10-31 22:00:49,642 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-10-31 22:00:49,642 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:00:49,646 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-10-31 22:00:49,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-10-31 22:00:49,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-10-31 22:00:49,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:49,674 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;@2660770a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:49,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-31 22:00:49,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:00:49,680 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-10-31 22:00:49,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:00:49,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:49,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:00:49,681 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-10-31 22:00:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 12997494, now seen corresponding path program 1 times [2024-10-31 22:00:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655275454] [2024-10-31 22:00:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655275454] [2024-10-31 22:00:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655275454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:00:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701796614] [2024-10-31 22:00:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:50,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:00:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:00:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:00:50,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:50,433 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-10-31 22:00:50,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:50,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:50,817 INFO L124 PetriNetUnfolderBase]: 466/824 cut-off events. [2024-10-31 22:00:50,817 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-31 22:00:50,820 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-10-31 22:00:50,829 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-10-31 22:00:50,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-10-31 22:00:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:00:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:00:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-10-31 22:00:50,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-10-31 22:00:50,850 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2024-10-31 22:00:50,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2024-10-31 22:00:50,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 22:00:50,861 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2024-10-31 22:00:50,866 INFO L260 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-10-31 22:00:50,870 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-10-31 22:00:50,871 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2024-10-31 22:00:50,872 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-10-31 22:00:50,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:50,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:00:50,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:00:50,873 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-10-31 22:00:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash -394243086, now seen corresponding path program 1 times [2024-10-31 22:00:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734275311] [2024-10-31 22:00:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734275311] [2024-10-31 22:00:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734275311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:51,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:51,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788042674] [2024-10-31 22:00:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:51,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:51,183 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-10-31 22:00:51,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:51,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:51,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:51,503 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2024-10-31 22:00:51,504 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-10-31 22:00:51,506 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-10-31 22:00:51,514 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2024-10-31 22:00:51,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2024-10-31 22:00:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:00:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:00:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-10-31 22:00:51,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2024-10-31 22:00:51,518 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-10-31 22:00:51,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2024-10-31 22:00:51,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:00:51,524 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2024-10-31 22:00:51,526 INFO L260 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-10-31 22:00:51,527 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-10-31 22:00:51,527 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2024-10-31 22:00:51,527 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-10-31 22:00:51,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:51,528 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:51,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:00:51,528 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-10-31 22:00:51,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash 959577463, now seen corresponding path program 1 times [2024-10-31 22:00:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:51,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503517874] [2024-10-31 22:00:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503517874] [2024-10-31 22:00:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503517874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:51,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:51,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296208964] [2024-10-31 22:00:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:51,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:51,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:51,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:51,873 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-10-31 22:00:51,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:51,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:51,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:52,183 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-10-31 22:00:52,183 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-10-31 22:00:52,185 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-10-31 22:00:52,190 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2024-10-31 22:00:52,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2024-10-31 22:00:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:00:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-10-31 22:00:52,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-10-31 22:00:52,193 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2024-10-31 22:00:52,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2024-10-31 22:00:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:00:52,196 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2024-10-31 22:00:52,197 INFO L260 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-10-31 22:00:52,197 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-10-31 22:00:52,198 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2024-10-31 22:00:52,198 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-10-31 22:00:52,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:52,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:52,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:00:52,199 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-10-31 22:00:52,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1835591283, now seen corresponding path program 1 times [2024-10-31 22:00:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:52,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595085] [2024-10-31 22:00:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595085] [2024-10-31 22:00:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:52,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:52,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:52,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173072902] [2024-10-31 22:00:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:52,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:52,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-10-31 22:00:52,330 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-10-31 22:00:52,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:52,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-10-31 22:00:52,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:52,566 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2024-10-31 22:00:52,567 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-10-31 22:00:52,568 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-10-31 22:00:52,570 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-10-31 22:00:52,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2024-10-31 22:00:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:00:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-10-31 22:00:52,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-10-31 22:00:52,573 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2024-10-31 22:00:52,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2024-10-31 22:00:52,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:00:52,577 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2024-10-31 22:00:52,577 INFO L260 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-10-31 22:00:52,578 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2024-10-31 22:00:52,578 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2024-10-31 22:00:52,579 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-10-31 22:00:52,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:52,579 INFO L204 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-10-31 22:00:52,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:00:52,580 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-10-31 22:00:52,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash -640282583, now seen corresponding path program 1 times [2024-10-31 22:00:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231497134] [2024-10-31 22:00:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231497134] [2024-10-31 22:00:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231497134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:00:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155254539] [2024-10-31 22:00:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:53,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:00:53,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:53,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:00:53,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:00:53,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:53,615 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-10-31 22:00:53,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:53,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:53,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:54,169 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-10-31 22:00:54,170 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-10-31 22:00:54,172 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-10-31 22:00:54,175 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2024-10-31 22:00:54,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2024-10-31 22:00:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:00:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-31 22:00:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-10-31 22:00:54,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2024-10-31 22:00:54,179 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2024-10-31 22:00:54,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2024-10-31 22:00:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:00:54,185 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2024-10-31 22:00:54,186 INFO L260 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-10-31 22:00:54,186 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-10-31 22:00:54,189 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2024-10-31 22:00:54,190 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-10-31 22:00:54,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:54,190 INFO L204 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-10-31 22:00:54,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:00:54,190 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-10-31 22:00:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1263566219, now seen corresponding path program 2 times [2024-10-31 22:00:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187374865] [2024-10-31 22:00:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187374865] [2024-10-31 22:00:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187374865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:00:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290067675] [2024-10-31 22:00:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:00:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:00:55,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:00:55,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:55,559 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-10-31 22:00:55,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:55,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:55,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:56,345 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2024-10-31 22:00:56,345 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2024-10-31 22:00:56,348 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-10-31 22:00:56,352 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2024-10-31 22:00:56,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2024-10-31 22:00:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:00:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-31 22:00:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2024-10-31 22:00:56,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2024-10-31 22:00:56,354 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2024-10-31 22:00:56,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2024-10-31 22:00:56,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:00:56,363 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2024-10-31 22:00:56,363 INFO L260 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-10-31 22:00:56,364 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-10-31 22:00:56,364 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2024-10-31 22:00:56,364 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-10-31 22:00:56,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:56,364 INFO L204 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-10-31 22:00:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:00:56,365 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-10-31 22:00:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 916898611, now seen corresponding path program 3 times [2024-10-31 22:00:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823323297] [2024-10-31 22:00:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823323297] [2024-10-31 22:00:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823323297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284202336] [2024-10-31 22:00:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:57,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:57,384 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-10-31 22:00:57,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:57,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:57,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:00:58,428 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2024-10-31 22:00:58,428 INFO L125 PetriNetUnfolderBase]: For 2981/2981 co-relation queries the response was YES. [2024-10-31 22:00:58,433 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-10-31 22:00:58,441 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-10-31 22:00:58,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2024-10-31 22:00:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 22:00:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-31 22:00:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2024-10-31 22:00:58,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2024-10-31 22:00:58,444 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2024-10-31 22:00:58,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2024-10-31 22:00:58,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:00:58,464 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2024-10-31 22:00:58,465 INFO L260 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-10-31 22:00:58,466 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-10-31 22:00:58,468 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2024-10-31 22:00:58,469 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-10-31 22:00:58,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:00:58,469 INFO L204 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-10-31 22:00:58,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:00:58,469 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-10-31 22:00:58,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash 259965645, now seen corresponding path program 4 times [2024-10-31 22:00:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784873151] [2024-10-31 22:00:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:00:59,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:59,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784873151] [2024-10-31 22:00:59,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784873151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:59,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363174273] [2024-10-31 22:00:59,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:59,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:59,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:59,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:00:59,277 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-10-31 22:00:59,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:00:59,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:00:59,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:00,213 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2024-10-31 22:01:00,213 INFO L125 PetriNetUnfolderBase]: For 5019/5019 co-relation queries the response was YES. [2024-10-31 22:01:00,219 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-10-31 22:01:00,226 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2024-10-31 22:01:00,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2024-10-31 22:01:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 22:01:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-31 22:01:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2024-10-31 22:01:00,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2024-10-31 22:01:00,228 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2024-10-31 22:01:00,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2024-10-31 22:01:00,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-10-31 22:01:00,268 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2024-10-31 22:01:00,268 INFO L260 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-10-31 22:01:00,270 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-10-31 22:01:00,271 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2024-10-31 22:01:00,271 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-10-31 22:01:00,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:00,271 INFO L204 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-10-31 22:01:00,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:01:00,272 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-10-31 22:01:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1799234892, now seen corresponding path program 1 times [2024-10-31 22:01:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:00,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057095762] [2024-10-31 22:01:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:02,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057095762] [2024-10-31 22:01:02,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057095762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:01:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806134348] [2024-10-31 22:01:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:01:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:01:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:02,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:01:02,129 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-10-31 22:01:02,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:02,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:01:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:03,561 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2024-10-31 22:01:03,561 INFO L125 PetriNetUnfolderBase]: For 8525/8525 co-relation queries the response was YES. [2024-10-31 22:01:03,565 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-10-31 22:01:03,574 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2024-10-31 22:01:03,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2024-10-31 22:01:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 22:01:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-31 22:01:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2024-10-31 22:01:03,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2024-10-31 22:01:03,576 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2024-10-31 22:01:03,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2024-10-31 22:01:03,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-10-31 22:01:03,629 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2024-10-31 22:01:03,629 INFO L260 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-10-31 22:01:03,630 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-10-31 22:01:03,630 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2024-10-31 22:01:03,630 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-10-31 22:01:03,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:03,630 INFO L204 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-10-31 22:01:03,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:01:03,631 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-10-31 22:01:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 752657800, now seen corresponding path program 2 times [2024-10-31 22:01:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067831807] [2024-10-31 22:01:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067831807] [2024-10-31 22:01:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067831807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:01:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344331323] [2024-10-31 22:01:04,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:01:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:04,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:01:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:05,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:01:05,050 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-10-31 22:01:05,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:05,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:01:05,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:06,852 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2024-10-31 22:01:06,852 INFO L125 PetriNetUnfolderBase]: For 11882/11882 co-relation queries the response was YES. [2024-10-31 22:01:06,861 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-10-31 22:01:06,874 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2024-10-31 22:01:06,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2024-10-31 22:01:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-31 22:01:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-31 22:01:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2024-10-31 22:01:06,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2024-10-31 22:01:06,878 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2024-10-31 22:01:06,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2024-10-31 22:01:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2024-10-31 22:01:06,980 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2024-10-31 22:01:06,981 INFO L260 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-10-31 22:01:06,982 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2024-10-31 22:01:06,982 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2024-10-31 22:01:06,982 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-10-31 22:01:06,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:06,983 INFO L204 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-10-31 22:01:06,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:01:06,983 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-10-31 22:01:06,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1629587922, now seen corresponding path program 3 times [2024-10-31 22:01:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826707655] [2024-10-31 22:01:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826707655] [2024-10-31 22:01:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826707655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:01:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206116114] [2024-10-31 22:01:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:01:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:01:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:08,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-10-31 22:01:08,429 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-10-31 22:01:08,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:08,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-10-31 22:01:08,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:10,375 INFO L124 PetriNetUnfolderBase]: 887/1770 cut-off events. [2024-10-31 22:01:10,375 INFO L125 PetriNetUnfolderBase]: For 12424/12424 co-relation queries the response was YES. [2024-10-31 22:01:10,383 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-10-31 22:01:10,393 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 136 selfloop transitions, 90 changer transitions 31/258 dead transitions. [2024-10-31 22:01:10,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 258 transitions, 3395 flow [2024-10-31 22:01:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-31 22:01:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-31 22:01:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 370 transitions. [2024-10-31 22:01:10,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.26811594202898553 [2024-10-31 22:01:10,397 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 23 states and 370 transitions. [2024-10-31 22:01:10,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 258 transitions, 3395 flow [2024-10-31 22:01:10,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 3178 flow, removed 51 selfloop flow, removed 12 redundant places. [2024-10-31 22:01:10,495 INFO L231 Difference]: Finished difference. Result has 151 places, 177 transitions, 2403 flow [2024-10-31 22:01:10,495 INFO L260 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-10-31 22:01:10,497 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-10-31 22:01:10,497 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 177 transitions, 2403 flow [2024-10-31 22:01:10,498 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-10-31 22:01:10,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:10,498 INFO L204 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-10-31 22:01:10,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:01:10,500 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-10-31 22:01:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 716253294, now seen corresponding path program 4 times [2024-10-31 22:01:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045392244] [2024-10-31 22:01:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:10,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:10,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:10,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:01:10,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-10-31 22:01:10,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-10-31 22:01:10,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-10-31 22:01:10,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-10-31 22:01:10,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-10-31 22:01:10,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-10-31 22:01:10,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-31 22:01:10,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-10-31 22:01:10,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:01:10,648 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2024-10-31 22:01:10,733 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:01:10,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:01:10,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:01:10 BasicIcfg [2024-10-31 22:01:10,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:01:10,741 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:01:10,741 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:01:10,741 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:01:10,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:49" (3/4) ... [2024-10-31 22:01:10,742 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:01:10,818 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:01:10,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:01:10,819 INFO L158 Benchmark]: Toolchain (without parser) took 23365.77ms. Allocated memory was 176.2MB in the beginning and 511.7MB in the end (delta: 335.5MB). Free memory was 129.2MB in the beginning and 335.9MB in the end (delta: -206.7MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,819 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 176.2MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:01:10,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.28ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 92.9MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.79ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,820 INFO L158 Benchmark]: Boogie Preprocessor took 111.56ms. Allocated memory is still 176.2MB. Free memory was 90.1MB in the beginning and 85.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,820 INFO L158 Benchmark]: RCFGBuilder took 960.31ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 85.9MB in the beginning and 179.0MB in the end (delta: -93.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,821 INFO L158 Benchmark]: TraceAbstraction took 21283.92ms. Allocated memory was 243.3MB in the beginning and 511.7MB in the end (delta: 268.4MB). Free memory was 179.0MB in the beginning and 344.3MB in the end (delta: -165.3MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,821 INFO L158 Benchmark]: Witness Printer took 77.61ms. Allocated memory is still 511.7MB. Free memory was 344.3MB in the beginning and 335.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 22:01:10,823 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.35ms. Allocated memory is still 176.2MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 834.28ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 92.9MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.79ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.56ms. Allocated memory is still 176.2MB. Free memory was 90.1MB in the beginning and 85.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 960.31ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 85.9MB in the beginning and 179.0MB in the end (delta: -93.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21283.92ms. Allocated memory was 243.3MB in the beginning and 511.7MB in the end (delta: 268.4MB). Free memory was 179.0MB in the beginning and 344.3MB in the end (delta: -165.3MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Witness Printer took 77.61ms. Allocated memory is still 511.7MB. Free memory was 344.3MB in the beginning and 335.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [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: 21.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1360 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1280 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 4.1s 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, 3.8s 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.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:01:10,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed015def-c5cc-4c0b-bba0-be1d09100fdd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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