/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/mix050.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:07:04,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:07:04,142 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 12:07:04,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:07:04,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:07:04,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:07:04,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:07:04,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:07:04,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:07:04,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:07:04,174 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:07:04,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:07:04,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:07:04,176 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:07:04,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:07:04,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:07:04,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:07:04,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:07:04,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:07:04,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:07:04,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:07:04,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:07:04,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:07:04,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:07:04,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:07:04,179 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:07:04,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:07:04,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:04,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:07:04,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:07:04,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:07:04,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:07:04,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:07:04,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:07:04,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:07:04,181 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 12:07:04,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:07:04,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:07:04,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:07:04,483 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:07:04,483 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:07:04,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2023-08-26 12:07:05,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:07:05,792 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:07:05,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2023-08-26 12:07:05,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d60f6d6/72bbf90d1df14eb29e3db44648a32f12/FLAGd505cf586 [2023-08-26 12:07:05,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d60f6d6/72bbf90d1df14eb29e3db44648a32f12 [2023-08-26 12:07:05,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:07:05,826 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:07:05,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:05,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:07:05,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:07:05,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:05" (1/1) ... [2023-08-26 12:07:05,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a5a6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:05, skipping insertion in model container [2023-08-26 12:07:05,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:05" (1/1) ... [2023-08-26 12:07:05,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:07:06,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:06,085 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:07:06,111 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:06,113 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:06,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:06,192 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:06,193 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:06,198 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:07:06,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06 WrapperNode [2023-08-26 12:07:06,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:06,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:06,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:07:06,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:07:06,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,265 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 12:07:06,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:06,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:07:06,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:07:06,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:07:06,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:07:06,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:07:06,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:07:06,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:07:06,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (1/1) ... [2023-08-26 12:07:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:07:06,399 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 12:07:06,442 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 12:07:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:07:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:07:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:07:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:07:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:07:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:07:06,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:07:06,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:07:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:07:06,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:07:06,461 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 12:07:06,592 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:07:06,594 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:07:06,857 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:07:07,000 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:07:07,000 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:07:07,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:07 BoogieIcfgContainer [2023-08-26 12:07:07,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:07:07,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:07:07,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:07:07,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:07:07,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:07:05" (1/3) ... [2023-08-26 12:07:07,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587cea29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:07, skipping insertion in model container [2023-08-26 12:07:07,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:06" (2/3) ... [2023-08-26 12:07:07,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587cea29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:07, skipping insertion in model container [2023-08-26 12:07:07,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:07" (3/3) ... [2023-08-26 12:07:07,006 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2023-08-26 12:07:07,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:07:07,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:07:07,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:07:07,055 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:07:07,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:07:07,127 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:07:07,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:07,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:07,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:07:07,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 12:07:07,139 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:07:07,152 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:07:07,155 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:07:07,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 12:07:07,188 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:07:07,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:07,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:07,191 INFO L119 LiptonReduction]: Number of co-enabled transitions 3470 [2023-08-26 12:07:10,959 INFO L134 LiptonReduction]: Checked pairs total: 10165 [2023-08-26 12:07:10,960 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-26 12:07:10,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:07:10,973 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;@583e6873, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:07:10,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:07:10,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:07:10,974 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:07:10,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:10,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:10,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:07:10,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:10,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash 629, now seen corresponding path program 1 times [2023-08-26 12:07:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737489894] [2023-08-26 12:07:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:11,053 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 12:07:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737489894] [2023-08-26 12:07:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737489894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:11,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:07:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659911485] [2023-08-26 12:07:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:11,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:07:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:07:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:07:11,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-26 12:07:11,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 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 12:07:11,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:11,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-26 12:07:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:11,828 INFO L124 PetriNetUnfolderBase]: 6239/8474 cut-off events. [2023-08-26 12:07:11,828 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-26 12:07:11,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17142 conditions, 8474 events. 6239/8474 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 41679 event pairs, 6239 based on Foata normal form. 0/7610 useless extension candidates. Maximal degree in co-relation 17130. Up to 8451 conditions per place. [2023-08-26 12:07:11,866 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 12:07:11,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-26 12:07:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:07:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:07:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 12:07:11,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017482517482518 [2023-08-26 12:07:11,876 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 12:07:11,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 12:07:11,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:11,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 12:07:11,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 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 12:07:11,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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 12:07:11,883 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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 12:07:11,884 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 287 transitions. [2023-08-26 12:07:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-26 12:07:11,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:07:11,889 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 12:07:11,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 12:07:11,892 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 12:07:11,892 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 12:07:11,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 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 12:07:11,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:11,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:07:11,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:07:11,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:11,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash 618047, now seen corresponding path program 1 times [2023-08-26 12:07:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:11,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280709849] [2023-08-26 12:07:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:12,147 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 12:07:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280709849] [2023-08-26 12:07:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280709849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:07:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527223287] [2023-08-26 12:07:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:12,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:12,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2023-08-26 12:07:12,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 12:07:12,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:12,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2023-08-26 12:07:12,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:12,689 INFO L124 PetriNetUnfolderBase]: 4903/7119 cut-off events. [2023-08-26 12:07:12,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:12,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13964 conditions, 7119 events. 4903/7119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41579 event pairs, 895 based on Foata normal form. 0/6795 useless extension candidates. Maximal degree in co-relation 13961. Up to 5335 conditions per place. [2023-08-26 12:07:12,716 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-26 12:07:12,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 200 flow [2023-08-26 12:07:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 12:07:12,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49067599067599066 [2023-08-26 12:07:12,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 12:07:12,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 12:07:12,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:12,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 12:07:12,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 12:07:12,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 12:07:12,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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 12:07:12,723 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 421 transitions. [2023-08-26 12:07:12,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 200 flow [2023-08-26 12:07:12,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:07:12,724 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-26 12:07:12,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 12:07:12,725 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 12:07:12,725 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-26 12:07:12,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 12:07:12,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:12,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:07:12,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:12,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 71699684, now seen corresponding path program 1 times [2023-08-26 12:07:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717240450] [2023-08-26 12:07:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:12,946 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 12:07:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717240450] [2023-08-26 12:07:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717240450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195732300] [2023-08-26 12:07:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:12,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 12:07:12,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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 12:07:12,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:12,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 12:07:12,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:13,357 INFO L124 PetriNetUnfolderBase]: 3395/4856 cut-off events. [2023-08-26 12:07:13,357 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-08-26 12:07:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10205 conditions, 4856 events. 3395/4856 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24999 event pairs, 634 based on Foata normal form. 320/5163 useless extension candidates. Maximal degree in co-relation 10201. Up to 3244 conditions per place. [2023-08-26 12:07:13,381 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 38 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2023-08-26 12:07:13,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 73 transitions, 310 flow [2023-08-26 12:07:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:07:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:07:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-26 12:07:13,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46293706293706294 [2023-08-26 12:07:13,384 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-26 12:07:13,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-26 12:07:13,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:13,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-26 12:07:13,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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 12:07:13,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 12:07:13,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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 12:07:13,392 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 662 transitions. [2023-08-26 12:07:13,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 73 transitions, 310 flow [2023-08-26 12:07:13,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:13,394 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-26 12:07:13,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-26 12:07:13,394 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-26 12:07:13,394 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-26 12:07:13,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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 12:07:13,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:13,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:13,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:07:13,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:13,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 147071095, now seen corresponding path program 1 times [2023-08-26 12:07:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424573376] [2023-08-26 12:07:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:13,572 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 12:07:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:13,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424573376] [2023-08-26 12:07:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424573376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:13,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:07:13,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999259016] [2023-08-26 12:07:13,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:13,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:07:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:07:13,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:07:13,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 12:07:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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 12:07:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:13,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 12:07:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:13,931 INFO L124 PetriNetUnfolderBase]: 1883/2831 cut-off events. [2023-08-26 12:07:13,931 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2023-08-26 12:07:13,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7622 conditions, 2831 events. 1883/2831 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14247 event pairs, 373 based on Foata normal form. 212/3030 useless extension candidates. Maximal degree in co-relation 7615. Up to 994 conditions per place. [2023-08-26 12:07:13,943 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 51 selfloop transitions, 9 changer transitions 27/90 dead transitions. [2023-08-26 12:07:13,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 459 flow [2023-08-26 12:07:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:07:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:07:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2023-08-26 12:07:13,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46445221445221446 [2023-08-26 12:07:13,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2023-08-26 12:07:13,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2023-08-26 12:07:13,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:13,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2023-08-26 12:07:13,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 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 12:07:13,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 12:07:13,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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 12:07:13,951 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 797 transitions. [2023-08-26 12:07:13,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 90 transitions, 459 flow [2023-08-26 12:07:13,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 90 transitions, 452 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:13,961 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-26 12:07:13,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-26 12:07:13,962 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 12:07:13,962 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-26 12:07:13,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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 12:07:13,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:13,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:13,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:07:13,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:13,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1872337925, now seen corresponding path program 1 times [2023-08-26 12:07:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:13,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520914811] [2023-08-26 12:07:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:14,127 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 12:07:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520914811] [2023-08-26 12:07:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520914811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:07:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330135661] [2023-08-26 12:07:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:14,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:07:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:14,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:07:14,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:07:14,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 12:07:14,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 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 12:07:14,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:14,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 12:07:14,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:14,411 INFO L124 PetriNetUnfolderBase]: 1163/1787 cut-off events. [2023-08-26 12:07:14,411 INFO L125 PetriNetUnfolderBase]: For 1724/1724 co-relation queries the response was YES. [2023-08-26 12:07:14,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5421 conditions, 1787 events. 1163/1787 cut-off events. For 1724/1724 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8488 event pairs, 329 based on Foata normal form. 77/1851 useless extension candidates. Maximal degree in co-relation 5412. Up to 630 conditions per place. [2023-08-26 12:07:14,419 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 62 selfloop transitions, 13 changer transitions 27/105 dead transitions. [2023-08-26 12:07:14,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 105 transitions, 628 flow [2023-08-26 12:07:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:07:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:07:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 930 transitions. [2023-08-26 12:07:14,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645354645354645 [2023-08-26 12:07:14,421 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 930 transitions. [2023-08-26 12:07:14,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 930 transitions. [2023-08-26 12:07:14,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:14,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 930 transitions. [2023-08-26 12:07:14,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 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 12:07:14,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 12:07:14,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 12:07:14,426 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 930 transitions. [2023-08-26 12:07:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 105 transitions, 628 flow [2023-08-26 12:07:14,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 105 transitions, 566 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-26 12:07:14,438 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-26 12:07:14,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-26 12:07:14,439 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 12:07:14,439 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-26 12:07:14,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 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 12:07:14,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:14,439 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] [2023-08-26 12:07:14,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:07:14,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:14,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash -574288177, now seen corresponding path program 1 times [2023-08-26 12:07:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346783779] [2023-08-26 12:07:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:14,654 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 12:07:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346783779] [2023-08-26 12:07:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346783779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:07:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480160293] [2023-08-26 12:07:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:14,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:07:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:07:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:07:14,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 12:07:14,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 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 12:07:14,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:14,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 12:07:14,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:14,886 INFO L124 PetriNetUnfolderBase]: 1011/1533 cut-off events. [2023-08-26 12:07:14,886 INFO L125 PetriNetUnfolderBase]: For 1449/1449 co-relation queries the response was YES. [2023-08-26 12:07:14,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 1533 events. 1011/1533 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7131 event pairs, 326 based on Foata normal form. 14/1534 useless extension candidates. Maximal degree in co-relation 4473. Up to 630 conditions per place. [2023-08-26 12:07:14,892 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 58 selfloop transitions, 17 changer transitions 14/92 dead transitions. [2023-08-26 12:07:14,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 564 flow [2023-08-26 12:07:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:07:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:07:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2023-08-26 12:07:14,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45236013986013984 [2023-08-26 12:07:14,895 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2023-08-26 12:07:14,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2023-08-26 12:07:14,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:14,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2023-08-26 12:07:14,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 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 12:07:14,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 12:07:14,900 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 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 12:07:14,900 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1035 transitions. [2023-08-26 12:07:14,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 92 transitions, 564 flow [2023-08-26 12:07:14,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 502 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-26 12:07:14,912 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-26 12:07:14,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-26 12:07:14,912 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 12:07:14,912 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-26 12:07:14,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 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 12:07:14,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:14,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:14,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:07:14,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:14,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 952786408, now seen corresponding path program 1 times [2023-08-26 12:07:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902688283] [2023-08-26 12:07:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:15,601 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 12:07:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902688283] [2023-08-26 12:07:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902688283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:07:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977615338] [2023-08-26 12:07:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:15,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:07:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:15,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:07:15,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:07:15,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 286 [2023-08-26 12:07:15,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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 12:07:15,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:15,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 286 [2023-08-26 12:07:15,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:15,912 INFO L124 PetriNetUnfolderBase]: 1159/1876 cut-off events. [2023-08-26 12:07:15,913 INFO L125 PetriNetUnfolderBase]: For 2151/2151 co-relation queries the response was YES. [2023-08-26 12:07:15,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5412 conditions, 1876 events. 1159/1876 cut-off events. For 2151/2151 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10061 event pairs, 145 based on Foata normal form. 1/1873 useless extension candidates. Maximal degree in co-relation 5401. Up to 773 conditions per place. [2023-08-26 12:07:15,919 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 68 selfloop transitions, 4 changer transitions 31/106 dead transitions. [2023-08-26 12:07:15,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 106 transitions, 796 flow [2023-08-26 12:07:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:07:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:07:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-08-26 12:07:15,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325674325674326 [2023-08-26 12:07:15,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-08-26 12:07:15,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-08-26 12:07:15,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:15,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-08-26 12:07:15,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 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 12:07:15,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 12:07:15,926 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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 12:07:15,926 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 7 states and 866 transitions. [2023-08-26 12:07:15,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 106 transitions, 796 flow [2023-08-26 12:07:15,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 106 transitions, 640 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-26 12:07:15,935 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 166 flow [2023-08-26 12:07:15,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-26 12:07:15,935 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 12:07:15,936 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 166 flow [2023-08-26 12:07:15,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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 12:07:15,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:15,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:15,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:07:15,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:15,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1808630198, now seen corresponding path program 2 times [2023-08-26 12:07:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061761406] [2023-08-26 12:07:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:16,076 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 12:07:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061761406] [2023-08-26 12:07:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061761406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:16,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003964005] [2023-08-26 12:07:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:16,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:16,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-26 12:07:16,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 12:07:16,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:16,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-26 12:07:16,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:16,422 INFO L124 PetriNetUnfolderBase]: 2879/4264 cut-off events. [2023-08-26 12:07:16,423 INFO L125 PetriNetUnfolderBase]: For 3033/3033 co-relation queries the response was YES. [2023-08-26 12:07:16,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11768 conditions, 4264 events. 2879/4264 cut-off events. For 3033/3033 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 21617 event pairs, 248 based on Foata normal form. 1/4265 useless extension candidates. Maximal degree in co-relation 11758. Up to 2562 conditions per place. [2023-08-26 12:07:16,433 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 81 selfloop transitions, 5 changer transitions 6/92 dead transitions. [2023-08-26 12:07:16,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 579 flow [2023-08-26 12:07:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:07:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:07:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-26 12:07:16,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4606643356643357 [2023-08-26 12:07:16,435 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-26 12:07:16,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-26 12:07:16,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:16,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-26 12:07:16,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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 12:07:16,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:16,438 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:16,438 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 166 flow. Second operand 4 states and 527 transitions. [2023-08-26 12:07:16,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 579 flow [2023-08-26 12:07:16,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 561 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 12:07:16,465 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 195 flow [2023-08-26 12:07:16,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-26 12:07:16,466 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 12:07:16,466 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 195 flow [2023-08-26 12:07:16,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 12:07:16,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:16,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:16,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:07:16,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:16,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash 192248974, now seen corresponding path program 3 times [2023-08-26 12:07:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332446850] [2023-08-26 12:07:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:16,599 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 12:07:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:16,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332446850] [2023-08-26 12:07:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332446850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:16,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:16,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992758773] [2023-08-26 12:07:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:16,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 286 [2023-08-26 12:07:16,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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 12:07:16,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:16,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 286 [2023-08-26 12:07:16,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:16,991 INFO L124 PetriNetUnfolderBase]: 3249/5105 cut-off events. [2023-08-26 12:07:16,991 INFO L125 PetriNetUnfolderBase]: For 4606/4606 co-relation queries the response was YES. [2023-08-26 12:07:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14720 conditions, 5105 events. 3249/5105 cut-off events. For 4606/4606 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 29989 event pairs, 551 based on Foata normal form. 1/5073 useless extension candidates. Maximal degree in co-relation 14709. Up to 2235 conditions per place. [2023-08-26 12:07:17,006 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 56 selfloop transitions, 1 changer transitions 31/92 dead transitions. [2023-08-26 12:07:17,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 605 flow [2023-08-26 12:07:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:07:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:07:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-26 12:07:17,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47027972027972026 [2023-08-26 12:07:17,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-26 12:07:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-26 12:07:17,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:17,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-26 12:07:17,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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 12:07:17,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:17,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:17,011 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 195 flow. Second operand 4 states and 538 transitions. [2023-08-26 12:07:17,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 605 flow [2023-08-26 12:07:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:07:17,060 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 203 flow [2023-08-26 12:07:17,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=4, PETRI_FLOW=203, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-26 12:07:17,061 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 12:07:17,061 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 203 flow [2023-08-26 12:07:17,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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 12:07:17,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:17,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:07:17,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:17,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -685873022, now seen corresponding path program 4 times [2023-08-26 12:07:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109770073] [2023-08-26 12:07:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:17,202 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 12:07:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109770073] [2023-08-26 12:07:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109770073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:17,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964967557] [2023-08-26 12:07:17,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:17,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:17,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-26 12:07:17,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 12:07:17,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:17,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-26 12:07:17,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:17,647 INFO L124 PetriNetUnfolderBase]: 3170/4857 cut-off events. [2023-08-26 12:07:17,647 INFO L125 PetriNetUnfolderBase]: For 5250/5250 co-relation queries the response was YES. [2023-08-26 12:07:17,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14690 conditions, 4857 events. 3170/4857 cut-off events. For 5250/5250 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25190 event pairs, 1186 based on Foata normal form. 1/4858 useless extension candidates. Maximal degree in co-relation 14677. Up to 2216 conditions per place. [2023-08-26 12:07:17,662 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 62 selfloop transitions, 5 changer transitions 24/91 dead transitions. [2023-08-26 12:07:17,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 623 flow [2023-08-26 12:07:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:07:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:07:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-08-26 12:07:17,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527972027972028 [2023-08-26 12:07:17,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-08-26 12:07:17,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-08-26 12:07:17,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:17,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-08-26 12:07:17,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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 12:07:17,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:17,667 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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 12:07:17,667 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 203 flow. Second operand 4 states and 518 transitions. [2023-08-26 12:07:17,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 623 flow [2023-08-26 12:07:17,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 619 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:17,715 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 253 flow [2023-08-26 12:07:17,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=200, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 12:07:17,715 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 12:07:17,716 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 253 flow [2023-08-26 12:07:17,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 12:07:17,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:17,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:17,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:07:17,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:17,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1878540298, now seen corresponding path program 5 times [2023-08-26 12:07:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096257036] [2023-08-26 12:07:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:07:17,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:07:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:07:17,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:07:17,804 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:07:17,805 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:07:17,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:07:17,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:07:17,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:07:17,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:07:17,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:07:17,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:07:17,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:07:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:07:17,808 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:17,813 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:07:17,813 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:07:17,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:07:17 BasicIcfg [2023-08-26 12:07:17,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:07:17,861 INFO L158 Benchmark]: Toolchain (without parser) took 12034.91ms. Allocated memory was 358.6MB in the beginning and 889.2MB in the end (delta: 530.6MB). Free memory was 333.4MB in the beginning and 624.8MB in the end (delta: -291.4MB). Peak memory consumption was 241.2MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,861 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 358.6MB. Free memory is still 334.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:07:17,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.81ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 308.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.60ms. Allocated memory is still 358.6MB. Free memory was 308.5MB in the beginning and 306.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,862 INFO L158 Benchmark]: Boogie Preprocessor took 43.08ms. Allocated memory is still 358.6MB. Free memory was 306.1MB in the beginning and 304.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,862 INFO L158 Benchmark]: RCFGBuilder took 691.34ms. Allocated memory is still 358.6MB. Free memory was 304.0MB in the beginning and 318.7MB in the end (delta: -14.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,862 INFO L158 Benchmark]: TraceAbstraction took 10858.13ms. Allocated memory was 358.6MB in the beginning and 889.2MB in the end (delta: 530.6MB). Free memory was 317.8MB in the beginning and 624.8MB in the end (delta: -307.0MB). Peak memory consumption was 226.5MB. Max. memory is 16.0GB. [2023-08-26 12:07:17,863 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.10ms. Allocated memory is still 358.6MB. Free memory is still 334.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 371.81ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 308.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.60ms. Allocated memory is still 358.6MB. Free memory was 308.5MB in the beginning and 306.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.08ms. Allocated memory is still 358.6MB. Free memory was 306.1MB in the beginning and 304.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 691.34ms. Allocated memory is still 358.6MB. Free memory was 304.0MB in the beginning and 318.7MB in the end (delta: -14.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 10858.13ms. Allocated memory was 358.6MB in the beginning and 889.2MB in the end (delta: 530.6MB). Free memory was 317.8MB in the beginning and 624.8MB in the end (delta: -307.0MB). Peak memory consumption was 226.5MB. 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.8s, 148 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 3470 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 144 TotalNumberOfCompositions, 10165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4199, independent: 3964, independent conditional: 0, independent unconditional: 3964, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1917, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4199, independent: 2096, independent conditional: 0, independent unconditional: 2096, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1917, unknown conditional: 0, unknown unconditional: 1917] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1321, ((void *)0), P0, ((void *)0))=-4, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-3, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=-2, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L869] 0 pthread_t t1324; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L822] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=1, y=1, z=1] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=1, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=1, x=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] 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", "mix050.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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: -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: 868]: 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: 870]: 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: 866]: 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: 864]: 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 9 procedures, 177 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1129 IncrementalHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 13 mSDtfsCounter, 1129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=10, InterpolantAutomatonStates: 50, 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, 1.9s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 12:07:17,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...