/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:59:21,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:59:21,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 11:59:21,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:59:21,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:59:21,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:59:21,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:59:21,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:59:21,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:59:21,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:59:21,729 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:59:21,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:59:21,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:59:21,730 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:59:21,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:59:21,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:59:21,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:59:21,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:59:21,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:59:21,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:59:21,731 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:59:21,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:59:21,732 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:59:21,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:59:21,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:59:21,733 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:59:21,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:59:21,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:59:21,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:59:21,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:59:21,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:59:21,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:59:21,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:59:21,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:59:21,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:59:21,735 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 11:59:21,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:59:21,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:59:21,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:59:21,996 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:59:21,997 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:59:21,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-08-26 11:59:22,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:59:23,167 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:59:23,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-08-26 11:59:23,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6a96c87/c5a595495be745e5969938c77d9375b9/FLAG6d64d077a [2023-08-26 11:59:23,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6a96c87/c5a595495be745e5969938c77d9375b9 [2023-08-26 11:59:23,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:59:23,194 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:59:23,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:59:23,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:59:23,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:59:23,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af067fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23, skipping insertion in model container [2023-08-26 11:59:23,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:59:23,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:59:23,500 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:59:23,527 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:59:23,528 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:59:23,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:59:23,587 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:59:23,587 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:59:23,591 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:59:23,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23 WrapperNode [2023-08-26 11:59:23,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:59:23,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:59:23,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:59:23,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:59:23,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,647 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-08-26 11:59:23,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:59:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:59:23,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:59:23,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:59:23,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:59:23,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:59:23,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:59:23,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:59:23,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (1/1) ... [2023-08-26 11:59:23,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:59:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:59:23,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 11:59:23,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 11:59:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 11:59:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 11:59:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 11:59:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 11:59:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 11:59:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:59:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 11:59:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:59:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:59:23,741 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 11:59:23,866 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:59:23,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:59:24,154 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:59:24,247 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:59:24,247 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 11:59:24,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:59:24 BoogieIcfgContainer [2023-08-26 11:59:24,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:59:24,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:59:24,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:59:24,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:59:24,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:59:23" (1/3) ... [2023-08-26 11:59:24,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e9aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:59:24, skipping insertion in model container [2023-08-26 11:59:24,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:23" (2/3) ... [2023-08-26 11:59:24,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e9aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:59:24, skipping insertion in model container [2023-08-26 11:59:24,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:59:24" (3/3) ... [2023-08-26 11:59:24,267 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-08-26 11:59:24,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:59:24,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 11:59:24,278 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:59:24,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:59:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 263 flow [2023-08-26 11:59:24,418 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-08-26 11:59:24,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:24,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 11:59:24,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 124 transitions, 263 flow [2023-08-26 11:59:24,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 121 transitions, 251 flow [2023-08-26 11:59:24,432 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:59:24,448 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 121 transitions, 251 flow [2023-08-26 11:59:24,451 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 121 transitions, 251 flow [2023-08-26 11:59:24,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 251 flow [2023-08-26 11:59:24,478 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-08-26 11:59:24,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:24,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 11:59:24,480 INFO L119 LiptonReduction]: Number of co-enabled transitions 2494 [2023-08-26 11:59:27,453 INFO L134 LiptonReduction]: Checked pairs total: 7000 [2023-08-26 11:59:27,454 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-26 11:59:27,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:59:27,468 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@97ff9ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:59:27,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 11:59:27,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:59:27,469 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 11:59:27,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:27,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:27,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:59:27,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:27,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash 561, now seen corresponding path program 1 times [2023-08-26 11:59:27,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:27,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110575481] [2023-08-26 11:59:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:27,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110575481] [2023-08-26 11:59:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110575481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:59:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66585636] [2023-08-26 11:59:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:27,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:59:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:59:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:59:27,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2023-08-26 11:59:27,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:27,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:27,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2023-08-26 11:59:27,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:27,921 INFO L124 PetriNetUnfolderBase]: 1555/2332 cut-off events. [2023-08-26 11:59:27,921 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 11:59:27,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 2332 events. 1555/2332 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11508 event pairs, 1555 based on Foata normal form. 96/2038 useless extension candidates. Maximal degree in co-relation 4668. Up to 2285 conditions per place. [2023-08-26 11:59:27,940 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-26 11:59:27,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 109 flow [2023-08-26 11:59:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:59:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:59:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2023-08-26 11:59:27,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 11:59:27,949 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2023-08-26 11:59:27,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2023-08-26 11:59:27,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:27,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2023-08-26 11:59:27,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:27,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:27,956 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:27,957 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 250 transitions. [2023-08-26 11:59:27,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 109 flow [2023-08-26 11:59:27,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:27,960 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-26 11:59:27,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-26 11:59:27,963 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-26 11:59:27,963 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-26 11:59:27,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:27,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:27,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:59:27,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:59:27,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:27,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 529762270, now seen corresponding path program 1 times [2023-08-26 11:59:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649844059] [2023-08-26 11:59:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649844059] [2023-08-26 11:59:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649844059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:59:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029738727] [2023-08-26 11:59:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:28,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:59:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:59:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:59:28,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-08-26 11:59:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:28,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-08-26 11:59:28,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:28,340 INFO L124 PetriNetUnfolderBase]: 1277/2016 cut-off events. [2023-08-26 11:59:28,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:28,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 2016 events. 1277/2016 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11073 event pairs, 165 based on Foata normal form. 0/1831 useless extension candidates. Maximal degree in co-relation 3952. Up to 1593 conditions per place. [2023-08-26 11:59:28,348 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-26 11:59:28,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 160 flow [2023-08-26 11:59:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:59:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:59:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-26 11:59:28,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48533333333333334 [2023-08-26 11:59:28,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-26 11:59:28,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-26 11:59:28,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:28,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-26 11:59:28,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,370 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 364 transitions. [2023-08-26 11:59:28,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 160 flow [2023-08-26 11:59:28,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:59:28,371 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2023-08-26 11:59:28,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-26 11:59:28,372 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-08-26 11:59:28,372 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2023-08-26 11:59:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:28,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:28,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:59:28,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:28,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash 771785144, now seen corresponding path program 1 times [2023-08-26 11:59:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862259879] [2023-08-26 11:59:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:28,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862259879] [2023-08-26 11:59:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862259879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:28,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:59:28,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984544051] [2023-08-26 11:59:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:28,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:28,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-26 11:59:28,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:28,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-26 11:59:28,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:28,819 INFO L124 PetriNetUnfolderBase]: 1115/1772 cut-off events. [2023-08-26 11:59:28,819 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-26 11:59:28,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 1772 events. 1115/1772 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8805 event pairs, 355 based on Foata normal form. 100/1866 useless extension candidates. Maximal degree in co-relation 3619. Up to 966 conditions per place. [2023-08-26 11:59:28,825 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 28 selfloop transitions, 2 changer transitions 19/52 dead transitions. [2023-08-26 11:59:28,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 218 flow [2023-08-26 11:59:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2023-08-26 11:59:28,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568 [2023-08-26 11:59:28,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2023-08-26 11:59:28,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2023-08-26 11:59:28,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:28,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2023-08-26 11:59:28,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,831 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 5 states and 571 transitions. [2023-08-26 11:59:28,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 218 flow [2023-08-26 11:59:28,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:28,833 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 66 flow [2023-08-26 11:59:28,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-26 11:59:28,833 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2023-08-26 11:59:28,834 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 66 flow [2023-08-26 11:59:28,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:28,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:28,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:59:28,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:28,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1168599443, now seen corresponding path program 1 times [2023-08-26 11:59:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273562878] [2023-08-26 11:59:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:28,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273562878] [2023-08-26 11:59:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273562878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:59:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655230855] [2023-08-26 11:59:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:28,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:28,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2023-08-26 11:59:28,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:28,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:28,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2023-08-26 11:59:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:29,132 INFO L124 PetriNetUnfolderBase]: 788/1295 cut-off events. [2023-08-26 11:59:29,132 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2023-08-26 11:59:29,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1295 events. 788/1295 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6489 event pairs, 235 based on Foata normal form. 60/1334 useless extension candidates. Maximal degree in co-relation 2703. Up to 745 conditions per place. [2023-08-26 11:59:29,138 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 28 selfloop transitions, 2 changer transitions 15/49 dead transitions. [2023-08-26 11:59:29,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 210 flow [2023-08-26 11:59:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-08-26 11:59:29,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4536 [2023-08-26 11:59:29,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-08-26 11:59:29,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-08-26 11:59:29,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:29,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-08-26 11:59:29,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,144 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 66 flow. Second operand 5 states and 567 transitions. [2023-08-26 11:59:29,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 210 flow [2023-08-26 11:59:29,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 202 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 11:59:29,149 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 70 flow [2023-08-26 11:59:29,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-26 11:59:29,150 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-26 11:59:29,150 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 70 flow [2023-08-26 11:59:29,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:29,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:59:29,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:29,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1024377915, now seen corresponding path program 1 times [2023-08-26 11:59:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622988388] [2023-08-26 11:59:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622988388] [2023-08-26 11:59:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622988388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394892180] [2023-08-26 11:59:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 11:59:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 11:59:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 11:59:29,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 250 [2023-08-26 11:59:29,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:29,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 250 [2023-08-26 11:59:29,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:29,861 INFO L124 PetriNetUnfolderBase]: 989/1583 cut-off events. [2023-08-26 11:59:29,862 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2023-08-26 11:59:29,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1583 events. 989/1583 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7803 event pairs, 236 based on Foata normal form. 49/1621 useless extension candidates. Maximal degree in co-relation 3505. Up to 1190 conditions per place. [2023-08-26 11:59:29,868 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 38 selfloop transitions, 6 changer transitions 14/61 dead transitions. [2023-08-26 11:59:29,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 273 flow [2023-08-26 11:59:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:59:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:59:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2023-08-26 11:59:29,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436 [2023-08-26 11:59:29,871 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 654 transitions. [2023-08-26 11:59:29,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 654 transitions. [2023-08-26 11:59:29,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:29,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 654 transitions. [2023-08-26 11:59:29,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,874 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,875 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 70 flow. Second operand 6 states and 654 transitions. [2023-08-26 11:59:29,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 273 flow [2023-08-26 11:59:29,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 263 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 11:59:29,879 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 109 flow [2023-08-26 11:59:29,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-26 11:59:29,879 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-26 11:59:29,879 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 109 flow [2023-08-26 11:59:29,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:29,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:29,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:59:29,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:29,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1633561029, now seen corresponding path program 1 times [2023-08-26 11:59:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187368963] [2023-08-26 11:59:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:30,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187368963] [2023-08-26 11:59:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187368963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882401655] [2023-08-26 11:59:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 11:59:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 11:59:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 11:59:30,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-26 11:59:30,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:30,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-26 11:59:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:30,406 INFO L124 PetriNetUnfolderBase]: 1039/1658 cut-off events. [2023-08-26 11:59:30,406 INFO L125 PetriNetUnfolderBase]: For 978/1032 co-relation queries the response was YES. [2023-08-26 11:59:30,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 1658 events. 1039/1658 cut-off events. For 978/1032 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8152 event pairs, 171 based on Foata normal form. 32/1673 useless extension candidates. Maximal degree in co-relation 4368. Up to 1277 conditions per place. [2023-08-26 11:59:30,413 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 45 selfloop transitions, 12 changer transitions 7/67 dead transitions. [2023-08-26 11:59:30,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 354 flow [2023-08-26 11:59:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:59:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:59:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-08-26 11:59:30,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44466666666666665 [2023-08-26 11:59:30,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-08-26 11:59:30,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-08-26 11:59:30,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:30,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-08-26 11:59:30,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,418 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,418 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 109 flow. Second operand 6 states and 667 transitions. [2023-08-26 11:59:30,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 354 flow [2023-08-26 11:59:30,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 11:59:30,422 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2023-08-26 11:59:30,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 11:59:30,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-08-26 11:59:30,425 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2023-08-26 11:59:30,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:30,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:30,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:59:30,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:30,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 802750473, now seen corresponding path program 2 times [2023-08-26 11:59:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809651106] [2023-08-26 11:59:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809651106] [2023-08-26 11:59:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809651106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:30,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 11:59:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252545748] [2023-08-26 11:59:30,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:30,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:59:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:59:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:59:30,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 250 [2023-08-26 11:59:30,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:30,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 250 [2023-08-26 11:59:30,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:31,110 INFO L124 PetriNetUnfolderBase]: 1179/1869 cut-off events. [2023-08-26 11:59:31,110 INFO L125 PetriNetUnfolderBase]: For 2818/2968 co-relation queries the response was YES. [2023-08-26 11:59:31,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6086 conditions, 1869 events. 1179/1869 cut-off events. For 2818/2968 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9356 event pairs, 126 based on Foata normal form. 44/1896 useless extension candidates. Maximal degree in co-relation 6073. Up to 1081 conditions per place. [2023-08-26 11:59:31,120 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 47 selfloop transitions, 16 changer transitions 12/78 dead transitions. [2023-08-26 11:59:31,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 512 flow [2023-08-26 11:59:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:59:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:59:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-08-26 11:59:31,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-26 11:59:31,123 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-08-26 11:59:31,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-08-26 11:59:31,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:31,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-08-26 11:59:31,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,126 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,128 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 7 states and 770 transitions. [2023-08-26 11:59:31,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 512 flow [2023-08-26 11:59:31,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 489 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:31,133 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 251 flow [2023-08-26 11:59:31,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-26 11:59:31,134 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-26 11:59:31,134 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 251 flow [2023-08-26 11:59:31,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:31,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:31,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:59:31,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:31,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2048376834, now seen corresponding path program 1 times [2023-08-26 11:59:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427273731] [2023-08-26 11:59:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427273731] [2023-08-26 11:59:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427273731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761741682] [2023-08-26 11:59:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:31,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:31,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2023-08-26 11:59:31,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:31,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2023-08-26 11:59:31,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:31,652 INFO L124 PetriNetUnfolderBase]: 2127/3353 cut-off events. [2023-08-26 11:59:31,652 INFO L125 PetriNetUnfolderBase]: For 9516/9541 co-relation queries the response was YES. [2023-08-26 11:59:31,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12233 conditions, 3353 events. 2127/3353 cut-off events. For 9516/9541 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18007 event pairs, 328 based on Foata normal form. 66/3416 useless extension candidates. Maximal degree in co-relation 12218. Up to 1703 conditions per place. [2023-08-26 11:59:31,674 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 69 selfloop transitions, 3 changer transitions 12/88 dead transitions. [2023-08-26 11:59:31,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 740 flow [2023-08-26 11:59:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-26 11:59:31,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4456 [2023-08-26 11:59:31,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-26 11:59:31,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-26 11:59:31,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:31,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-26 11:59:31,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,680 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,680 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 251 flow. Second operand 5 states and 557 transitions. [2023-08-26 11:59:31,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 740 flow [2023-08-26 11:59:31,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 667 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 11:59:31,691 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 247 flow [2023-08-26 11:59:31,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-26 11:59:31,693 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-08-26 11:59:31,693 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 247 flow [2023-08-26 11:59:31,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:31,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:31,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:59:31,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:31,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 720049180, now seen corresponding path program 2 times [2023-08-26 11:59:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607454496] [2023-08-26 11:59:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607454496] [2023-08-26 11:59:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607454496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:59:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955589302] [2023-08-26 11:59:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:31,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:59:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:59:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:59:31,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2023-08-26 11:59:31,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:31,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2023-08-26 11:59:31,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,009 INFO L124 PetriNetUnfolderBase]: 829/1462 cut-off events. [2023-08-26 11:59:32,009 INFO L125 PetriNetUnfolderBase]: For 4291/4372 co-relation queries the response was YES. [2023-08-26 11:59:32,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1462 events. 829/1462 cut-off events. For 4291/4372 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7788 event pairs, 190 based on Foata normal form. 98/1546 useless extension candidates. Maximal degree in co-relation 5466. Up to 1137 conditions per place. [2023-08-26 11:59:32,017 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 51 selfloop transitions, 4 changer transitions 3/65 dead transitions. [2023-08-26 11:59:32,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 497 flow [2023-08-26 11:59:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:59:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:59:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-26 11:59:32,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-26 11:59:32,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-26 11:59:32,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-26 11:59:32,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-26 11:59:32,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,020 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 247 flow. Second operand 3 states and 350 transitions. [2023-08-26 11:59:32,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 497 flow [2023-08-26 11:59:32,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 483 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:32,025 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 264 flow [2023-08-26 11:59:32,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-26 11:59:32,026 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-26 11:59:32,026 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 264 flow [2023-08-26 11:59:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 11:59:32,027 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:32,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -701906189, now seen corresponding path program 1 times [2023-08-26 11:59:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583152401] [2023-08-26 11:59:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583152401] [2023-08-26 11:59:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583152401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482798562] [2023-08-26 11:59:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:32,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2023-08-26 11:59:32,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2023-08-26 11:59:32,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,258 INFO L124 PetriNetUnfolderBase]: 388/763 cut-off events. [2023-08-26 11:59:32,258 INFO L125 PetriNetUnfolderBase]: For 1751/1825 co-relation queries the response was YES. [2023-08-26 11:59:32,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2922 conditions, 763 events. 388/763 cut-off events. For 1751/1825 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3774 event pairs, 97 based on Foata normal form. 96/851 useless extension candidates. Maximal degree in co-relation 2905. Up to 255 conditions per place. [2023-08-26 11:59:32,260 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 56 selfloop transitions, 7 changer transitions 6/76 dead transitions. [2023-08-26 11:59:32,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 586 flow [2023-08-26 11:59:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:59:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:59:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-26 11:59:32,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467 [2023-08-26 11:59:32,262 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-26 11:59:32,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-26 11:59:32,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-26 11:59:32,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,265 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 264 flow. Second operand 4 states and 467 transitions. [2023-08-26 11:59:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 586 flow [2023-08-26 11:59:32,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 11:59:32,269 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 279 flow [2023-08-26 11:59:32,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-26 11:59:32,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-26 11:59:32,271 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 279 flow [2023-08-26 11:59:32,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,271 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] [2023-08-26 11:59:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 11:59:32,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:32,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2054405251, now seen corresponding path program 1 times [2023-08-26 11:59:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212019097] [2023-08-26 11:59:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212019097] [2023-08-26 11:59:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212019097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903518233] [2023-08-26 11:59:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:32,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2023-08-26 11:59:32,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2023-08-26 11:59:32,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,499 INFO L124 PetriNetUnfolderBase]: 327/628 cut-off events. [2023-08-26 11:59:32,499 INFO L125 PetriNetUnfolderBase]: For 1824/1898 co-relation queries the response was YES. [2023-08-26 11:59:32,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 628 events. 327/628 cut-off events. For 1824/1898 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3061 event pairs, 88 based on Foata normal form. 40/660 useless extension candidates. Maximal degree in co-relation 2438. Up to 255 conditions per place. [2023-08-26 11:59:32,502 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 47 selfloop transitions, 10 changer transitions 12/75 dead transitions. [2023-08-26 11:59:32,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 596 flow [2023-08-26 11:59:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2023-08-26 11:59:32,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576 [2023-08-26 11:59:32,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2023-08-26 11:59:32,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2023-08-26 11:59:32,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2023-08-26 11:59:32,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,506 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 279 flow. Second operand 5 states and 572 transitions. [2023-08-26 11:59:32,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 596 flow [2023-08-26 11:59:32,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 552 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-26 11:59:32,511 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 258 flow [2023-08-26 11:59:32,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-26 11:59:32,511 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-08-26 11:59:32,511 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 258 flow [2023-08-26 11:59:32,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 11:59:32,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:32,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 473430064, now seen corresponding path program 1 times [2023-08-26 11:59:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445982300] [2023-08-26 11:59:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:32,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445982300] [2023-08-26 11:59:32,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445982300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:32,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601828548] [2023-08-26 11:59:32,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:32,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:32,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-08-26 11:59:32,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-08-26 11:59:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,814 INFO L124 PetriNetUnfolderBase]: 406/788 cut-off events. [2023-08-26 11:59:32,814 INFO L125 PetriNetUnfolderBase]: For 2073/2077 co-relation queries the response was YES. [2023-08-26 11:59:32,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 788 events. 406/788 cut-off events. For 2073/2077 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3972 event pairs, 85 based on Foata normal form. 5/790 useless extension candidates. Maximal degree in co-relation 3038. Up to 448 conditions per place. [2023-08-26 11:59:32,816 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 39 selfloop transitions, 1 changer transitions 43/87 dead transitions. [2023-08-26 11:59:32,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 712 flow [2023-08-26 11:59:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-26 11:59:32,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444 [2023-08-26 11:59:32,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-26 11:59:32,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-26 11:59:32,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-26 11:59:32,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,821 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 258 flow. Second operand 5 states and 555 transitions. [2023-08-26 11:59:32,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 712 flow [2023-08-26 11:59:32,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 620 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-08-26 11:59:32,826 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 181 flow [2023-08-26 11:59:32,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-08-26 11:59:32,827 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-26 11:59:32,827 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 181 flow [2023-08-26 11:59:32,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 11:59:32,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:59:32,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1297266810, now seen corresponding path program 2 times [2023-08-26 11:59:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448083976] [2023-08-26 11:59:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:32,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:59:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:32,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:59:32,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:59:32,928 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 11:59:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 11:59:32,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 11:59:32,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 11:59:32,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 11:59:32,931 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:59:32,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:59:32,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:59:32 BasicIcfg [2023-08-26 11:59:32,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:59:32,992 INFO L158 Benchmark]: Toolchain (without parser) took 9797.86ms. Allocated memory was 402.7MB in the beginning and 817.9MB in the end (delta: 415.2MB). Free memory was 377.3MB in the beginning and 727.5MB in the end (delta: -350.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.0GB. [2023-08-26 11:59:32,992 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 402.7MB. Free memory is still 378.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:59:32,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.40ms. Allocated memory is still 402.7MB. Free memory was 377.3MB in the beginning and 353.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:32,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.37ms. Allocated memory is still 402.7MB. Free memory was 353.7MB in the beginning and 350.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:32,992 INFO L158 Benchmark]: Boogie Preprocessor took 27.38ms. Allocated memory is still 402.7MB. Free memory was 350.9MB in the beginning and 349.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,000 INFO L158 Benchmark]: RCFGBuilder took 560.09ms. Allocated memory is still 402.7MB. Free memory was 348.8MB in the beginning and 355.5MB in the end (delta: -6.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,001 INFO L158 Benchmark]: TraceAbstraction took 8741.73ms. Allocated memory was 402.7MB in the beginning and 817.9MB in the end (delta: 415.2MB). Free memory was 355.0MB in the beginning and 727.5MB in the end (delta: -372.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,002 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.11ms. Allocated memory is still 402.7MB. Free memory is still 378.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 398.40ms. Allocated memory is still 402.7MB. Free memory was 377.3MB in the beginning and 353.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.37ms. Allocated memory is still 402.7MB. Free memory was 353.7MB in the beginning and 350.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.38ms. Allocated memory is still 402.7MB. Free memory was 350.9MB in the beginning and 349.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 560.09ms. Allocated memory is still 402.7MB. Free memory was 348.8MB in the beginning and 355.5MB in the end (delta: -6.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 8741.73ms. Allocated memory was 402.7MB in the beginning and 817.9MB in the end (delta: 415.2MB). Free memory was 355.0MB in the beginning and 727.5MB in the end (delta: -372.6MB). Peak memory consumption was 42.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 128 PlacesBefore, 43 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2494 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 126 TotalNumberOfCompositions, 7000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3094, independent: 2906, independent conditional: 0, independent unconditional: 2906, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1344, independent: 1312, independent conditional: 0, independent unconditional: 1312, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3094, independent: 1594, independent conditional: 0, independent unconditional: 1594, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1344, unknown conditional: 0, unknown unconditional: 1344] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-3, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-2, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L839] 0 pthread_t t301; [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=-1, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix011_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 12 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: 8.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1149 IncrementalHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 8 mSDtfsCounter, 1149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=10, InterpolantAutomatonStates: 56, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 11:59:33,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...