./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:30:22,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:30:22,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:30:22,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:30:22,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:30:22,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:30:22,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:30:22,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:30:22,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:30:22,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:30:22,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:30:22,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:30:22,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:30:22,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:30:22,506 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:30:22,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:30:22,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:30:22,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:30:22,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:30:22,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:30:22,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:30:22,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:30:22,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:30:22,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:30:22,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:30:22,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:30:22,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:30:22,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:30:22,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:30:22,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:30:22,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:30:22,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:30:22,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:22,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:30:22,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:30:22,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:30:22,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:30:22,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:30:22,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:30:22,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:30:22,513 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:30:22,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:30:22,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:30:22,514 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-06-27 17:30:22,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:30:22,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:30:22,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:30:22,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:30:22,755 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:30:22,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-06-27 17:30:23,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:30:23,962 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:30:23,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-06-27 17:30:23,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc80261b7/2eaad29e2627465f9129bf013b2ffe09/FLAG3ddd967b6 [2024-06-27 17:30:24,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc80261b7/2eaad29e2627465f9129bf013b2ffe09 [2024-06-27 17:30:24,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:30:24,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:30:24,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:24,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:30:24,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:30:24,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c58706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24, skipping insertion in model container [2024-06-27 17:30:24,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:30:24,389 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-06-27 17:30:24,436 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:24,444 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:30:24,479 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-06-27 17:30:24,486 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:24,533 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:30:24,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24 WrapperNode [2024-06-27 17:30:24,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:24,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:24,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:30:24,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:30:24,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,598 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2024-06-27 17:30:24,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:24,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:30:24,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:30:24,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:30:24,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,646 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 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, 2, 6]. [2024-06-27 17:30:24,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:30:24,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:30:24,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:30:24,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:30:24,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (1/1) ... [2024-06-27 17:30:24,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:24,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:30:24,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:30:24,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:30:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-06-27 17:30:24,755 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-06-27 17:30:24,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:30:24,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:30:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:30:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:30:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:30:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:30:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:30:24,759 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:30:24,967 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:30:24,968 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:30:25,177 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:30:25,178 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:30:25,279 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:30:25,279 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:30:25,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:25 BoogieIcfgContainer [2024-06-27 17:30:25,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:30:25,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:30:25,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:30:25,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:30:25,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:30:24" (1/3) ... [2024-06-27 17:30:25,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5ec3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:25, skipping insertion in model container [2024-06-27 17:30:25,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:24" (2/3) ... [2024-06-27 17:30:25,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5ec3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:25, skipping insertion in model container [2024-06-27 17:30:25,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:25" (3/3) ... [2024-06-27 17:30:25,289 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-06-27 17:30:25,295 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:30:25,302 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:30:25,302 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 17:30:25,304 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:30:25,343 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:30:25,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2024-06-27 17:30:25,406 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2024-06-27 17:30:25,407 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:30:25,410 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-06-27 17:30:25,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2024-06-27 17:30:25,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2024-06-27 17:30:25,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:30:25,425 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@383e7dd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:30:25,425 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 17:30:25,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:30:25,427 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2024-06-27 17:30:25,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:30:25,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:25,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 17:30:25,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:25,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 12997494, now seen corresponding path program 1 times [2024-06-27 17:30:25,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:25,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915844802] [2024-06-27 17:30:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:25,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915844802] [2024-06-27 17:30:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915844802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:30:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162025078] [2024-06-27 17:30:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:25,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:30:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:30:25,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:30:25,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:25,937 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-06-27 17:30:25,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:25,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:25,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,143 INFO L124 PetriNetUnfolderBase]: 466/824 cut-off events. [2024-06-27 17:30:26,143 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-06-27 17:30:26,148 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 3430 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-06-27 17:30:26,153 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-27 17:30:26,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2024-06-27 17:30:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:30:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:30:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-27 17:30:26,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 17:30:26,168 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2024-06-27 17:30:26,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2024-06-27 17:30:26,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:30:26,176 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2024-06-27 17:30:26,178 INFO L264 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-06-27 17:30:26,182 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-06-27 17:30:26,182 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2024-06-27 17:30:26,183 INFO L496 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-06-27 17:30:26,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 17:30:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:30:26,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:26,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -394243086, now seen corresponding path program 1 times [2024-06-27 17:30:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305554041] [2024-06-27 17:30:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305554041] [2024-06-27 17:30:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305554041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352385809] [2024-06-27 17:30:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:26,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:26,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:26,395 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-06-27 17:30:26,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:26,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:26,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,539 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2024-06-27 17:30:26,539 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-06-27 17:30:26,540 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-06-27 17:30:26,544 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2024-06-27 17:30:26,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2024-06-27 17:30:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:30:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:30:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 17:30:26,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2024-06-27 17:30:26,546 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-06-27 17:30:26,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2024-06-27 17:30:26,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:26,549 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2024-06-27 17:30:26,550 INFO L264 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-06-27 17:30:26,550 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-06-27 17:30:26,550 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2024-06-27 17:30:26,551 INFO L496 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-06-27 17:30:26,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:26,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:30:26,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:26,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 959577463, now seen corresponding path program 1 times [2024-06-27 17:30:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131081862] [2024-06-27 17:30:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:26,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131081862] [2024-06-27 17:30:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131081862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644790090] [2024-06-27 17:30:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:26,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:26,742 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-06-27 17:30:26,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:26,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:26,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,904 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2024-06-27 17:30:26,904 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-06-27 17:30:26,905 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-06-27 17:30:26,908 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2024-06-27 17:30:26,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2024-06-27 17:30:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-06-27 17:30:26,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 17:30:26,910 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2024-06-27 17:30:26,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2024-06-27 17:30:26,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:30:26,912 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2024-06-27 17:30:26,912 INFO L264 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-06-27 17:30:26,912 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-06-27 17:30:26,913 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2024-06-27 17:30:26,913 INFO L496 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-06-27 17:30:26,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:30:26,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:26,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1835591283, now seen corresponding path program 1 times [2024-06-27 17:30:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318137342] [2024-06-27 17:30:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:26,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:26,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318137342] [2024-06-27 17:30:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318137342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:26,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:26,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170451995] [2024-06-27 17:30:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:26,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-06-27 17:30:26,973 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-06-27 17:30:26,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:26,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-06-27 17:30:26,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:27,060 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2024-06-27 17:30:27,061 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-06-27 17:30:27,062 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-06-27 17:30:27,063 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-27 17:30:27,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2024-06-27 17:30:27,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 17:30:27,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2024-06-27 17:30:27,065 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2024-06-27 17:30:27,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2024-06-27 17:30:27,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:30:27,067 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2024-06-27 17:30:27,067 INFO L264 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-06-27 17:30:27,067 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2024-06-27 17:30:27,068 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2024-06-27 17:30:27,068 INFO L496 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-06-27 17:30:27,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:27,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:30:27,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:27,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -640282583, now seen corresponding path program 1 times [2024-06-27 17:30:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162762432] [2024-06-27 17:30:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162762432] [2024-06-27 17:30:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162762432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:30:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116589366] [2024-06-27 17:30:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:30:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:30:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:30:27,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:27,548 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-06-27 17:30:27,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:27,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:27,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:27,832 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-06-27 17:30:27,832 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-06-27 17:30:27,834 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-06-27 17:30:27,835 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2024-06-27 17:30:27,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2024-06-27 17:30:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:30:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:30:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-06-27 17:30:27,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2024-06-27 17:30:27,838 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2024-06-27 17:30:27,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2024-06-27 17:30:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:27,843 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2024-06-27 17:30:27,843 INFO L264 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-06-27 17:30:27,845 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-06-27 17:30:27,845 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2024-06-27 17:30:27,845 INFO L496 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-06-27 17:30:27,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:27,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:27,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:30:27,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:27,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1263566219, now seen corresponding path program 2 times [2024-06-27 17:30:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226599992] [2024-06-27 17:30:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226599992] [2024-06-27 17:30:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226599992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 17:30:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895860651] [2024-06-27 17:30:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:28,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:30:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:30:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:30:28,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:28,619 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-06-27 17:30:28,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:28,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:28,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:29,048 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2024-06-27 17:30:29,048 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2024-06-27 17:30:29,050 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-06-27 17:30:29,053 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2024-06-27 17:30:29,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2024-06-27 17:30:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:30:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:30:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2024-06-27 17:30:29,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2024-06-27 17:30:29,055 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2024-06-27 17:30:29,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2024-06-27 17:30:29,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:30:29,061 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2024-06-27 17:30:29,062 INFO L264 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-06-27 17:30:29,063 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 17:30:29,064 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2024-06-27 17:30:29,064 INFO L496 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-06-27 17:30:29,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:29,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:29,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:30:29,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:29,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 916898611, now seen corresponding path program 3 times [2024-06-27 17:30:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095959551] [2024-06-27 17:30:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095959551] [2024-06-27 17:30:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095959551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 17:30:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017557134] [2024-06-27 17:30:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:30:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:30:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:30:29,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:29,581 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-06-27 17:30:29,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:29,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:29,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:30,081 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2024-06-27 17:30:30,081 INFO L125 PetriNetUnfolderBase]: For 2981/2981 co-relation queries the response was YES. [2024-06-27 17:30:30,084 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-06-27 17:30:30,088 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-06-27 17:30:30,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2024-06-27 17:30:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:30:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:30:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2024-06-27 17:30:30,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2024-06-27 17:30:30,089 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2024-06-27 17:30:30,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2024-06-27 17:30:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:30:30,107 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2024-06-27 17:30:30,107 INFO L264 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-06-27 17:30:30,108 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-06-27 17:30:30,108 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2024-06-27 17:30:30,108 INFO L496 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-06-27 17:30:30,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:30,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:30:30,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:30,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 259965645, now seen corresponding path program 4 times [2024-06-27 17:30:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722949938] [2024-06-27 17:30:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:30,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722949938] [2024-06-27 17:30:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722949938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:30,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:30,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 17:30:30,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473481858] [2024-06-27 17:30:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:30,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:30:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:30,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:30:30,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:30:30,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:30,569 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-06-27 17:30:30,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:30,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:30,990 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2024-06-27 17:30:30,990 INFO L125 PetriNetUnfolderBase]: For 5019/5019 co-relation queries the response was YES. [2024-06-27 17:30:30,993 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-06-27 17:30:30,997 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2024-06-27 17:30:30,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2024-06-27 17:30:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:30:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:30:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2024-06-27 17:30:30,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2024-06-27 17:30:30,999 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2024-06-27 17:30:30,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2024-06-27 17:30:31,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 17:30:31,015 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2024-06-27 17:30:31,015 INFO L264 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-06-27 17:30:31,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-06-27 17:30:31,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2024-06-27 17:30:31,016 INFO L496 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-06-27 17:30:31,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:31,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:30:31,017 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:31,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1799234892, now seen corresponding path program 1 times [2024-06-27 17:30:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821143073] [2024-06-27 17:30:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821143073] [2024-06-27 17:30:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821143073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:31,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-06-27 17:30:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982813353] [2024-06-27 17:30:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:30:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:30:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:30:31,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:31,856 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-06-27 17:30:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:31,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:31,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:32,555 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2024-06-27 17:30:32,556 INFO L125 PetriNetUnfolderBase]: For 8484/8484 co-relation queries the response was YES. [2024-06-27 17:30:32,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1579 events. 826/1579 cut-off events. For 8484/8484 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8790 event pairs, 261 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 5535. Up to 966 conditions per place. [2024-06-27 17:30:32,563 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2024-06-27 17:30:32,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2024-06-27 17:30:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:30:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:30:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2024-06-27 17:30:32,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2024-06-27 17:30:32,565 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2024-06-27 17:30:32,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2024-06-27 17:30:32,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 17:30:32,591 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2024-06-27 17:30:32,592 INFO L264 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-06-27 17:30:32,592 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 17:30:32,593 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2024-06-27 17:30:32,593 INFO L496 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-06-27 17:30:32,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:32,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:32,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:30:32,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:32,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 752657800, now seen corresponding path program 2 times [2024-06-27 17:30:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633006606] [2024-06-27 17:30:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633006606] [2024-06-27 17:30:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633006606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:33,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-06-27 17:30:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811671301] [2024-06-27 17:30:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:30:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:30:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:30:33,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:33,324 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-06-27 17:30:33,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:33,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:33,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:34,134 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2024-06-27 17:30:34,134 INFO L125 PetriNetUnfolderBase]: For 11899/11899 co-relation queries the response was YES. [2024-06-27 17:30:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1824 events. 935/1824 cut-off events. For 11899/11899 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10811 event pairs, 328 based on Foata normal form. 2/1826 useless extension candidates. Maximal degree in co-relation 8081. Up to 1234 conditions per place. [2024-06-27 17:30:34,146 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2024-06-27 17:30:34,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2024-06-27 17:30:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:30:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:30:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2024-06-27 17:30:34,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2024-06-27 17:30:34,148 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2024-06-27 17:30:34,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2024-06-27 17:30:34,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2024-06-27 17:30:34,187 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2024-06-27 17:30:34,187 INFO L264 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-06-27 17:30:34,188 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2024-06-27 17:30:34,188 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2024-06-27 17:30:34,188 INFO L496 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-06-27 17:30:34,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:34,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:30:34,189 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:34,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 637342284, now seen corresponding path program 3 times [2024-06-27 17:30:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738096367] [2024-06-27 17:30:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738096367] [2024-06-27 17:30:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738096367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 17:30:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299798288] [2024-06-27 17:30:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:30:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:30:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:30:34,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2024-06-27 17:30:34,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 2184 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 17:30:34,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:34,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2024-06-27 17:30:34,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:35,613 INFO L124 PetriNetUnfolderBase]: 973/1984 cut-off events. [2024-06-27 17:30:35,613 INFO L125 PetriNetUnfolderBase]: For 13732/13732 co-relation queries the response was YES. [2024-06-27 17:30:35,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1984 events. 973/1984 cut-off events. For 13732/13732 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12351 event pairs, 423 based on Foata normal form. 2/1986 useless extension candidates. Maximal degree in co-relation 8912. Up to 864 conditions per place. [2024-06-27 17:30:35,626 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 165 selfloop transitions, 82 changer transitions 31/279 dead transitions. [2024-06-27 17:30:35,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 279 transitions, 3754 flow [2024-06-27 17:30:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:30:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:30:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 357 transitions. [2024-06-27 17:30:35,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27045454545454545 [2024-06-27 17:30:35,628 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 22 states and 357 transitions. [2024-06-27 17:30:35,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 279 transitions, 3754 flow [2024-06-27 17:30:35,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 279 transitions, 3512 flow, removed 57 selfloop flow, removed 12 redundant places. [2024-06-27 17:30:35,722 INFO L231 Difference]: Finished difference. Result has 149 places, 183 transitions, 2435 flow [2024-06-27 17:30:35,723 INFO L264 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=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2435, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2024-06-27 17:30:35,723 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 96 predicate places. [2024-06-27 17:30:35,723 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 2435 flow [2024-06-27 17:30:35,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-06-27 17:30:35,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:35,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:30:35,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:35,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash 716253294, now seen corresponding path program 4 times [2024-06-27 17:30:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024040181] [2024-06-27 17:30:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:35,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:30:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:35,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:30:35,798 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:30:35,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-06-27 17:30:35,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-27 17:30:35,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-06-27 17:30:35,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-06-27 17:30:35,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-06-27 17:30:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-06-27 17:30:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-27 17:30:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-27 17:30:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:30:35,803 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2024-06-27 17:30:35,807 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:30:35,808 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:30:35,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:30:35 BasicIcfg [2024-06-27 17:30:35,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:30:35,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:30:35,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:30:35,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:30:35,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:25" (3/4) ... [2024-06-27 17:30:35,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:30:35,923 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:30:35,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:30:35,924 INFO L158 Benchmark]: Toolchain (without parser) took 11917.68ms. Allocated memory was 146.8MB in the beginning and 486.5MB in the end (delta: 339.7MB). Free memory was 71.9MB in the beginning and 390.1MB in the end (delta: -318.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,924 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:35,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.11ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 71.8MB in the beginning and 137.3MB in the end (delta: -65.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.10ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 134.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,925 INFO L158 Benchmark]: Boogie Preprocessor took 85.56ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,925 INFO L158 Benchmark]: RCFGBuilder took 596.06ms. Allocated memory is still 192.9MB. Free memory was 131.1MB in the beginning and 91.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,925 INFO L158 Benchmark]: TraceAbstraction took 10579.07ms. Allocated memory was 192.9MB in the beginning and 486.5MB in the end (delta: 293.6MB). Free memory was 90.2MB in the beginning and 398.5MB in the end (delta: -308.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:35,925 INFO L158 Benchmark]: Witness Printer took 61.04ms. Allocated memory is still 486.5MB. Free memory was 398.5MB in the beginning and 390.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-27 17:30:35,926 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.16ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.11ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 71.8MB in the beginning and 137.3MB in the end (delta: -65.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.10ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 134.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.56ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.06ms. Allocated memory is still 192.9MB. Free memory was 131.1MB in the beginning and 91.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10579.07ms. Allocated memory was 192.9MB in the beginning and 486.5MB in the end (delta: 293.6MB). Free memory was 90.2MB in the beginning and 398.5MB in the end (delta: -308.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.04ms. Allocated memory is still 486.5MB. Free memory was 398.5MB in the beginning and 390.1MB 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=2147483646, 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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] [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=2147483646, t2=2147483647] - 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: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1276 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1201 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3727 IncrementalHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 36 mSDtfsCounter, 3727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2435occurred in iteration=11, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2772 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-06-27 17:30:35,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE