/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -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/safe028_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:24:04,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:24:04,827 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 15:24:04,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:24:04,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:24:04,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:24:04,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:24:04,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:24:04,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:24:04,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:24:04,879 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:24:04,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:24:04,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:24:04,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:24:04,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:24:04,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:24:04,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:24:04,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:24:04,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:24:04,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:24:04,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:24:04,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:24:04,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:24:04,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:24:04,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:24:04,888 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:24:04,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:24:04,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:24:04,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:24:04,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:24:04,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:24:04,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:24:04,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:24:04,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:24:04,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:24:04,891 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 15:24:05,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:24:05,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:24:05,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:24:05,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:24:05,209 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:24:05,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2023-08-26 15:24:06,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:24:06,685 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:24:06,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2023-08-26 15:24:06,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72552d191/8a35d33596cc4289a2c10a29fe05e653/FLAG8a736b046 [2023-08-26 15:24:06,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72552d191/8a35d33596cc4289a2c10a29fe05e653 [2023-08-26 15:24:06,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:24:06,718 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:24:06,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:24:06,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:24:06,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:24:06,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:24:06" (1/1) ... [2023-08-26 15:24:06,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afe17b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:06, skipping insertion in model container [2023-08-26 15:24:06,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:24:06" (1/1) ... [2023-08-26 15:24:06,762 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:24:07,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:24:07,181 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:24:07,197 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:24:07,199 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:24:07,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:24:07,286 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:24:07,286 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:24:07,292 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:24:07,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07 WrapperNode [2023-08-26 15:24:07,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:24:07,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:24:07,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:24:07,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:24:07,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,368 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-26 15:24:07,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:24:07,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:24:07,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:24:07,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:24:07,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:24:07,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:24:07,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:24:07,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:24:07,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (1/1) ... [2023-08-26 15:24:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:24:07,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:24:07,440 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 15:24:07,459 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 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:24:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:24:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:24:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:24:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:24:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:24:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:24:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:24:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:24:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:24:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:24:07,484 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 15:24:07,608 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:24:07,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:24:08,049 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:24:08,374 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:24:08,375 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:24:08,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:24:08 BoogieIcfgContainer [2023-08-26 15:24:08,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:24:08,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:24:08,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:24:08,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:24:08,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:24:06" (1/3) ... [2023-08-26 15:24:08,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2fbdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:24:08, skipping insertion in model container [2023-08-26 15:24:08,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:07" (2/3) ... [2023-08-26 15:24:08,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2fbdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:24:08, skipping insertion in model container [2023-08-26 15:24:08,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:24:08" (3/3) ... [2023-08-26 15:24:08,385 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2023-08-26 15:24:08,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:24:08,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-08-26 15:24:08,401 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:24:08,537 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:24:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 174 transitions, 363 flow [2023-08-26 15:24:08,680 INFO L124 PetriNetUnfolderBase]: 3/171 cut-off events. [2023-08-26 15:24:08,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:08,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 3/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 271 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-08-26 15:24:08,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 174 transitions, 363 flow [2023-08-26 15:24:08,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 171 transitions, 351 flow [2023-08-26 15:24:08,699 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:24:08,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 171 transitions, 351 flow [2023-08-26 15:24:08,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 171 transitions, 351 flow [2023-08-26 15:24:08,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 171 transitions, 351 flow [2023-08-26 15:24:08,770 INFO L124 PetriNetUnfolderBase]: 3/171 cut-off events. [2023-08-26 15:24:08,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:08,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 3/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 269 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-08-26 15:24:08,777 INFO L119 LiptonReduction]: Number of co-enabled transitions 6810 [2023-08-26 15:24:15,563 INFO L134 LiptonReduction]: Checked pairs total: 39131 [2023-08-26 15:24:15,563 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-26 15:24:15,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:24:15,579 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;@8d1932d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:24:15,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2023-08-26 15:24:15,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:24:15,580 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:24:15,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:15,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:15,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:24:15,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:15,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1023, now seen corresponding path program 1 times [2023-08-26 15:24:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104150904] [2023-08-26 15:24:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:15,694 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 15:24:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104150904] [2023-08-26 15:24:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104150904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:24:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449093579] [2023-08-26 15:24:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:24:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:15,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:24:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:24:15,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 317 [2023-08-26 15:24:15,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 155 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 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 15:24:15,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:15,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 317 [2023-08-26 15:24:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:19,454 INFO L124 PetriNetUnfolderBase]: 21848/30507 cut-off events. [2023-08-26 15:24:19,454 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 15:24:19,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61093 conditions, 30507 events. 21848/30507 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2504. Compared 201183 event pairs, 21848 based on Foata normal form. 0/13193 useless extension candidates. Maximal degree in co-relation 61082. Up to 30448 conditions per place. [2023-08-26 15:24:19,648 INFO L140 encePairwiseOnDemand]: 290/317 looper letters, 44 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2023-08-26 15:24:19,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 187 flow [2023-08-26 15:24:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:24:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:24:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-26 15:24:19,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 15:24:19,667 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-26 15:24:19,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-26 15:24:19,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:19,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-26 15:24:19,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 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 15:24:19,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 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 15:24:19,680 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 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 15:24:19,682 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 155 flow. Second operand 2 states and 317 transitions. [2023-08-26 15:24:19,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 187 flow [2023-08-26 15:24:19,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:24:19,690 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 96 flow [2023-08-26 15:24:19,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-26 15:24:19,696 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2023-08-26 15:24:19,696 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 96 flow [2023-08-26 15:24:19,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 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 15:24:19,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:19,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:24:19,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:24:19,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:19,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 31380049, now seen corresponding path program 1 times [2023-08-26 15:24:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629009574] [2023-08-26 15:24:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:19,981 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 15:24:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629009574] [2023-08-26 15:24:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629009574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:24:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262309149] [2023-08-26 15:24:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:19,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:19,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:19,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 317 [2023-08-26 15:24:19,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 15:24:19,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:19,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 317 [2023-08-26 15:24:19,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:21,833 INFO L124 PetriNetUnfolderBase]: 12266/18107 cut-off events. [2023-08-26 15:24:21,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:21,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36084 conditions, 18107 events. 12266/18107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 119607 event pairs, 8101 based on Foata normal form. 0/10502 useless extension candidates. Maximal degree in co-relation 36081. Up to 11727 conditions per place. [2023-08-26 15:24:21,931 INFO L140 encePairwiseOnDemand]: 299/317 looper letters, 51 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2023-08-26 15:24:21,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 248 flow [2023-08-26 15:24:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-26 15:24:21,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943217665615142 [2023-08-26 15:24:21,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-26 15:24:21,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-26 15:24:21,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:21,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-26 15:24:21,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 15:24:21,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:21,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:21,939 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 96 flow. Second operand 3 states and 375 transitions. [2023-08-26 15:24:21,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 248 flow [2023-08-26 15:24:21,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:24:21,941 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 170 flow [2023-08-26 15:24:21,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-26 15:24:21,942 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -27 predicate places. [2023-08-26 15:24:21,942 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 170 flow [2023-08-26 15:24:21,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 15:24:21,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:21,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 15:24:21,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:24:21,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:21,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 31380050, now seen corresponding path program 1 times [2023-08-26 15:24:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165587516] [2023-08-26 15:24:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:22,031 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 15:24:22,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:22,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165587516] [2023-08-26 15:24:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165587516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:22,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:22,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:24:22,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976251659] [2023-08-26 15:24:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:22,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:22,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:22,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 317 [2023-08-26 15:24:22,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 15:24:22,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:22,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 317 [2023-08-26 15:24:22,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:22,668 INFO L124 PetriNetUnfolderBase]: 3399/5355 cut-off events. [2023-08-26 15:24:22,668 INFO L125 PetriNetUnfolderBase]: For 1763/1763 co-relation queries the response was YES. [2023-08-26 15:24:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15001 conditions, 5355 events. 3399/5355 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 32002 event pairs, 2558 based on Foata normal form. 1597/6534 useless extension candidates. Maximal degree in co-relation 14996. Up to 5234 conditions per place. [2023-08-26 15:24:22,683 INFO L140 encePairwiseOnDemand]: 307/317 looper letters, 39 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 15:24:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 232 flow [2023-08-26 15:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-26 15:24:22,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3785488958990536 [2023-08-26 15:24:22,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-26 15:24:22,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-26 15:24:22,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:22,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-26 15:24:22,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 15:24:22,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:22,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:22,689 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 170 flow. Second operand 3 states and 360 transitions. [2023-08-26 15:24:22,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 232 flow [2023-08-26 15:24:22,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:22,702 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 136 flow [2023-08-26 15:24:22,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 15:24:22,703 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-26 15:24:22,703 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 136 flow [2023-08-26 15:24:22,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 15:24:22,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:22,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:22,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:24:22,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:22,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 196828746, now seen corresponding path program 1 times [2023-08-26 15:24:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317462494] [2023-08-26 15:24:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:22,897 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 15:24:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317462494] [2023-08-26 15:24:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317462494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:24:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075161903] [2023-08-26 15:24:22,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:22,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:22,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 317 [2023-08-26 15:24:22,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 15:24:22,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:22,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 317 [2023-08-26 15:24:22,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:23,411 INFO L124 PetriNetUnfolderBase]: 3319/5307 cut-off events. [2023-08-26 15:24:23,411 INFO L125 PetriNetUnfolderBase]: For 760/760 co-relation queries the response was YES. [2023-08-26 15:24:23,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13760 conditions, 5307 events. 3319/5307 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 32422 event pairs, 1119 based on Foata normal form. 0/4370 useless extension candidates. Maximal degree in co-relation 13755. Up to 3945 conditions per place. [2023-08-26 15:24:23,430 INFO L140 encePairwiseOnDemand]: 313/317 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-26 15:24:23,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 334 flow [2023-08-26 15:24:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-26 15:24:23,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4395373291272345 [2023-08-26 15:24:23,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-26 15:24:23,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-26 15:24:23,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:23,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-26 15:24:23,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 15:24:23,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:23,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:23,436 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 136 flow. Second operand 3 states and 418 transitions. [2023-08-26 15:24:23,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 334 flow [2023-08-26 15:24:23,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:24:23,438 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 148 flow [2023-08-26 15:24:23,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-26 15:24:23,439 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -34 predicate places. [2023-08-26 15:24:23,439 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 148 flow [2023-08-26 15:24:23,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 15:24:23,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:23,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:23,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:24:23,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:23,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 196828951, now seen corresponding path program 1 times [2023-08-26 15:24:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464678760] [2023-08-26 15:24:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:23,799 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 15:24:23,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464678760] [2023-08-26 15:24:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464678760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:23,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:24:23,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904664453] [2023-08-26 15:24:23,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:23,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:23,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 317 [2023-08-26 15:24:23,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 15:24:23,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:23,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 317 [2023-08-26 15:24:23,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:24,436 INFO L124 PetriNetUnfolderBase]: 3279/5235 cut-off events. [2023-08-26 15:24:24,436 INFO L125 PetriNetUnfolderBase]: For 1101/1101 co-relation queries the response was YES. [2023-08-26 15:24:24,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14178 conditions, 5235 events. 3279/5235 cut-off events. For 1101/1101 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 31905 event pairs, 1127 based on Foata normal form. 0/4467 useless extension candidates. Maximal degree in co-relation 14172. Up to 3929 conditions per place. [2023-08-26 15:24:24,461 INFO L140 encePairwiseOnDemand]: 314/317 looper letters, 58 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-26 15:24:24,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 342 flow [2023-08-26 15:24:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-26 15:24:24,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434279705573081 [2023-08-26 15:24:24,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-26 15:24:24,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-26 15:24:24,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:24,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-26 15:24:24,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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 15:24:24,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:24,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:24,468 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 148 flow. Second operand 3 states and 413 transitions. [2023-08-26 15:24:24,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 342 flow [2023-08-26 15:24:24,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:24,471 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 153 flow [2023-08-26 15:24:24,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 15:24:24,472 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2023-08-26 15:24:24,472 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 153 flow [2023-08-26 15:24:24,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 15:24:24,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:24,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:24,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:24:24,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:24,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1806729128, now seen corresponding path program 1 times [2023-08-26 15:24:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610802735] [2023-08-26 15:24:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:24,563 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 15:24:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610802735] [2023-08-26 15:24:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610802735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:24:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60102044] [2023-08-26 15:24:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:24,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 317 [2023-08-26 15:24:24,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 15:24:24,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:24,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 317 [2023-08-26 15:24:24,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:25,271 INFO L124 PetriNetUnfolderBase]: 3547/5734 cut-off events. [2023-08-26 15:24:25,271 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2023-08-26 15:24:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15750 conditions, 5734 events. 3547/5734 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 35975 event pairs, 1572 based on Foata normal form. 0/5062 useless extension candidates. Maximal degree in co-relation 15743. Up to 3930 conditions per place. [2023-08-26 15:24:25,294 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-26 15:24:25,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 297 flow [2023-08-26 15:24:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-26 15:24:25,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774973711882229 [2023-08-26 15:24:25,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-26 15:24:25,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-26 15:24:25,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:25,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-26 15:24:25,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 15:24:25,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:25,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:25,300 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 153 flow. Second operand 3 states and 359 transitions. [2023-08-26 15:24:25,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 297 flow [2023-08-26 15:24:25,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:25,303 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 176 flow [2023-08-26 15:24:25,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-08-26 15:24:25,304 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2023-08-26 15:24:25,304 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 176 flow [2023-08-26 15:24:25,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 15:24:25,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:25,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:24:25,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:25,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1806729129, now seen corresponding path program 1 times [2023-08-26 15:24:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782662862] [2023-08-26 15:24:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:25,641 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 15:24:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782662862] [2023-08-26 15:24:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782662862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:25,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:25,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:24:25,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625987833] [2023-08-26 15:24:25,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:25,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:25,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:25,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:25,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:25,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 317 [2023-08-26 15:24:25,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 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 15:24:25,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:25,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 317 [2023-08-26 15:24:25,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:26,193 INFO L124 PetriNetUnfolderBase]: 2859/4620 cut-off events. [2023-08-26 15:24:26,193 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2023-08-26 15:24:26,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13412 conditions, 4620 events. 2859/4620 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 27363 event pairs, 792 based on Foata normal form. 48/4290 useless extension candidates. Maximal degree in co-relation 13404. Up to 3431 conditions per place. [2023-08-26 15:24:26,203 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-26 15:24:26,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 348 flow [2023-08-26 15:24:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:24:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:24:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-26 15:24:26,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627760252365931 [2023-08-26 15:24:26,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-26 15:24:26,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-26 15:24:26,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:26,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-26 15:24:26,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 15:24:26,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:26,209 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:26,209 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 176 flow. Second operand 4 states and 460 transitions. [2023-08-26 15:24:26,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 348 flow [2023-08-26 15:24:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:26,216 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 162 flow [2023-08-26 15:24:26,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-26 15:24:26,217 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -35 predicate places. [2023-08-26 15:24:26,217 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 162 flow [2023-08-26 15:24:26,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 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 15:24:26,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:26,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:24:26,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:26,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1806729333, now seen corresponding path program 1 times [2023-08-26 15:24:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:26,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872422753] [2023-08-26 15:24:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:27,389 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 15:24:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872422753] [2023-08-26 15:24:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872422753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:24:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649879544] [2023-08-26 15:24:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:24:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:24:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:24:27,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 317 [2023-08-26 15:24:27,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 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 15:24:27,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:27,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 317 [2023-08-26 15:24:27,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:28,154 INFO L124 PetriNetUnfolderBase]: 2843/4556 cut-off events. [2023-08-26 15:24:28,154 INFO L125 PetriNetUnfolderBase]: For 2239/2239 co-relation queries the response was YES. [2023-08-26 15:24:28,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13081 conditions, 4556 events. 2843/4556 cut-off events. For 2239/2239 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 26756 event pairs, 1337 based on Foata normal form. 6/4170 useless extension candidates. Maximal degree in co-relation 13074. Up to 3921 conditions per place. [2023-08-26 15:24:28,169 INFO L140 encePairwiseOnDemand]: 308/317 looper letters, 80 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2023-08-26 15:24:28,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 657 flow [2023-08-26 15:24:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:24:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:24:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2023-08-26 15:24:28,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30977917981072556 [2023-08-26 15:24:28,172 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2023-08-26 15:24:28,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2023-08-26 15:24:28,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:28,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2023-08-26 15:24:28,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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 15:24:28,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 317.0) internal successors, (3487), 11 states have internal predecessors, (3487), 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 15:24:28,180 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 317.0) internal successors, (3487), 11 states have internal predecessors, (3487), 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 15:24:28,180 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 162 flow. Second operand 10 states and 982 transitions. [2023-08-26 15:24:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 657 flow [2023-08-26 15:24:28,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:28,188 INFO L231 Difference]: Finished difference. Result has 59 places, 70 transitions, 409 flow [2023-08-26 15:24:28,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=409, PETRI_PLACES=59, PETRI_TRANSITIONS=70} [2023-08-26 15:24:28,189 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -23 predicate places. [2023-08-26 15:24:28,189 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 70 transitions, 409 flow [2023-08-26 15:24:28,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 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 15:24:28,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:28,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:28,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:24:28,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:28,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1499931824, now seen corresponding path program 1 times [2023-08-26 15:24:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:28,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004120572] [2023-08-26 15:24:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:28,375 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 15:24:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004120572] [2023-08-26 15:24:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004120572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:24:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183928511] [2023-08-26 15:24:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:28,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:28,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 317 [2023-08-26 15:24:28,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 70 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 15:24:28,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:28,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 317 [2023-08-26 15:24:28,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:28,611 INFO L124 PetriNetUnfolderBase]: 1003/1777 cut-off events. [2023-08-26 15:24:28,611 INFO L125 PetriNetUnfolderBase]: For 1415/1415 co-relation queries the response was YES. [2023-08-26 15:24:28,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5653 conditions, 1777 events. 1003/1777 cut-off events. For 1415/1415 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9658 event pairs, 259 based on Foata normal form. 27/1743 useless extension candidates. Maximal degree in co-relation 5641. Up to 1605 conditions per place. [2023-08-26 15:24:28,617 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 68 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2023-08-26 15:24:28,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 521 flow [2023-08-26 15:24:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-26 15:24:28,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195583596214511 [2023-08-26 15:24:28,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-26 15:24:28,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-26 15:24:28,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:28,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-26 15:24:28,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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 15:24:28,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:28,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 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 15:24:28,622 INFO L175 Difference]: Start difference. First operand has 59 places, 70 transitions, 409 flow. Second operand 3 states and 399 transitions. [2023-08-26 15:24:28,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 521 flow [2023-08-26 15:24:28,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 501 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 15:24:28,631 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 311 flow [2023-08-26 15:24:28,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2023-08-26 15:24:28,632 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -23 predicate places. [2023-08-26 15:24:28,632 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 311 flow [2023-08-26 15:24:28,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 15:24:28,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:28,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:28,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:24:28,633 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:28,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -496441903, now seen corresponding path program 1 times [2023-08-26 15:24:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636767008] [2023-08-26 15:24:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:30,165 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 15:24:30,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636767008] [2023-08-26 15:24:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636767008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:24:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814340254] [2023-08-26 15:24:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:24:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:24:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:24:30,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 317 [2023-08-26 15:24:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 87.5) internal successors, (875), 10 states have internal predecessors, (875), 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 15:24:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 317 [2023-08-26 15:24:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:31,125 INFO L124 PetriNetUnfolderBase]: 1008/1803 cut-off events. [2023-08-26 15:24:31,125 INFO L125 PetriNetUnfolderBase]: For 1407/1407 co-relation queries the response was YES. [2023-08-26 15:24:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 1803 events. 1008/1803 cut-off events. For 1407/1407 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9905 event pairs, 325 based on Foata normal form. 12/1755 useless extension candidates. Maximal degree in co-relation 6076. Up to 1450 conditions per place. [2023-08-26 15:24:31,131 INFO L140 encePairwiseOnDemand]: 305/317 looper letters, 89 selfloop transitions, 36 changer transitions 2/128 dead transitions. [2023-08-26 15:24:31,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 128 transitions, 882 flow [2023-08-26 15:24:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 15:24:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 15:24:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1133 transitions. [2023-08-26 15:24:31,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29784437434279704 [2023-08-26 15:24:31,134 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1133 transitions. [2023-08-26 15:24:31,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1133 transitions. [2023-08-26 15:24:31,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:31,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1133 transitions. [2023-08-26 15:24:31,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 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 15:24:31,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 317.0) internal successors, (4121), 13 states have internal predecessors, (4121), 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 15:24:31,142 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 317.0) internal successors, (4121), 13 states have internal predecessors, (4121), 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 15:24:31,142 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 311 flow. Second operand 12 states and 1133 transitions. [2023-08-26 15:24:31,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 128 transitions, 882 flow [2023-08-26 15:24:31,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 873 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:24:31,149 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 586 flow [2023-08-26 15:24:31,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=586, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2023-08-26 15:24:31,150 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -6 predicate places. [2023-08-26 15:24:31,150 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 586 flow [2023-08-26 15:24:31,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.5) internal successors, (875), 10 states have internal predecessors, (875), 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 15:24:31,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:31,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:31,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:24:31,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:31,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 321947457, now seen corresponding path program 1 times [2023-08-26 15:24:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475055007] [2023-08-26 15:24:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:31,360 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 15:24:31,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:31,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475055007] [2023-08-26 15:24:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475055007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:31,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:24:31,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189889266] [2023-08-26 15:24:31,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:31,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:24:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:24:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:24:31,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 317 [2023-08-26 15:24:31,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 586 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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 15:24:31,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:31,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 317 [2023-08-26 15:24:31,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:31,517 INFO L124 PetriNetUnfolderBase]: 243/487 cut-off events. [2023-08-26 15:24:31,517 INFO L125 PetriNetUnfolderBase]: For 723/723 co-relation queries the response was YES. [2023-08-26 15:24:31,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 487 events. 243/487 cut-off events. For 723/723 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1903 event pairs, 56 based on Foata normal form. 27/510 useless extension candidates. Maximal degree in co-relation 1796. Up to 225 conditions per place. [2023-08-26 15:24:31,520 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 78 selfloop transitions, 7 changer transitions 4/90 dead transitions. [2023-08-26 15:24:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 758 flow [2023-08-26 15:24:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:24:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:24:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-26 15:24:31,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41719242902208203 [2023-08-26 15:24:31,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-26 15:24:31,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-26 15:24:31,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:31,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-26 15:24:31,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 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 15:24:31,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:31,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:31,525 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 586 flow. Second operand 4 states and 529 transitions. [2023-08-26 15:24:31,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 758 flow [2023-08-26 15:24:31,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 684 flow, removed 30 selfloop flow, removed 6 redundant places. [2023-08-26 15:24:31,532 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 365 flow [2023-08-26 15:24:31,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-08-26 15:24:31,533 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -14 predicate places. [2023-08-26 15:24:31,533 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 365 flow [2023-08-26 15:24:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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 15:24:31,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:31,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:31,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:24:31,534 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:31,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1407962615, now seen corresponding path program 1 times [2023-08-26 15:24:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:31,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904843815] [2023-08-26 15:24:31,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:31,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:31,767 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 15:24:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904843815] [2023-08-26 15:24:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904843815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014018833] [2023-08-26 15:24:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:31,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:31,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:31,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:31,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 317 [2023-08-26 15:24:31,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 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 15:24:31,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:31,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 317 [2023-08-26 15:24:31,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:31,902 INFO L124 PetriNetUnfolderBase]: 162/303 cut-off events. [2023-08-26 15:24:31,902 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2023-08-26 15:24:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 303 events. 162/303 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1016 event pairs, 39 based on Foata normal form. 9/311 useless extension candidates. Maximal degree in co-relation 1160. Up to 134 conditions per place. [2023-08-26 15:24:31,904 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 57 selfloop transitions, 10 changer transitions 4/72 dead transitions. [2023-08-26 15:24:31,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 575 flow [2023-08-26 15:24:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:24:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:24:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-26 15:24:31,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050473186119874 [2023-08-26 15:24:31,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-26 15:24:31,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-26 15:24:31,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:31,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-26 15:24:31,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 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 15:24:31,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 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 15:24:31,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 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 15:24:31,911 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 365 flow. Second operand 5 states and 642 transitions. [2023-08-26 15:24:31,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 575 flow [2023-08-26 15:24:31,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 506 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-26 15:24:31,914 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 250 flow [2023-08-26 15:24:31,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-26 15:24:31,916 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -24 predicate places. [2023-08-26 15:24:31,916 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 250 flow [2023-08-26 15:24:31,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 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 15:24:31,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:31,916 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] [2023-08-26 15:24:31,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:24:31,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:31,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1212775031, now seen corresponding path program 1 times [2023-08-26 15:24:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427984063] [2023-08-26 15:24:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:32,348 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 15:24:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427984063] [2023-08-26 15:24:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427984063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:32,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018703905] [2023-08-26 15:24:32,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:32,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:24:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:24:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:24:32,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 317 [2023-08-26 15:24:32,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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 15:24:32,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:32,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 317 [2023-08-26 15:24:32,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:32,548 INFO L124 PetriNetUnfolderBase]: 242/436 cut-off events. [2023-08-26 15:24:32,548 INFO L125 PetriNetUnfolderBase]: For 828/828 co-relation queries the response was YES. [2023-08-26 15:24:32,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 436 events. 242/436 cut-off events. For 828/828 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1661 event pairs, 37 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 1618. Up to 261 conditions per place. [2023-08-26 15:24:32,550 INFO L140 encePairwiseOnDemand]: 312/317 looper letters, 39 selfloop transitions, 2 changer transitions 46/87 dead transitions. [2023-08-26 15:24:32,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 713 flow [2023-08-26 15:24:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:24:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:24:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-26 15:24:32,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3922187171398528 [2023-08-26 15:24:32,553 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-26 15:24:32,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-26 15:24:32,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:32,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-26 15:24:32,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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 15:24:32,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:32,557 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:32,557 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 250 flow. Second operand 6 states and 746 transitions. [2023-08-26 15:24:32,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 713 flow [2023-08-26 15:24:32,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 651 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 15:24:32,563 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 188 flow [2023-08-26 15:24:32,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2023-08-26 15:24:32,564 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -23 predicate places. [2023-08-26 15:24:32,564 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 188 flow [2023-08-26 15:24:32,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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 15:24:32,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:32,565 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] [2023-08-26 15:24:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:24:32,565 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:32,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 334733101, now seen corresponding path program 2 times [2023-08-26 15:24:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046847858] [2023-08-26 15:24:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:32,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:34,052 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 15:24:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046847858] [2023-08-26 15:24:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046847858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:24:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448390729] [2023-08-26 15:24:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:24:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:24:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:24:34,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 317 [2023-08-26 15:24:34,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 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 15:24:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 317 [2023-08-26 15:24:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:34,339 INFO L124 PetriNetUnfolderBase]: 233/455 cut-off events. [2023-08-26 15:24:34,339 INFO L125 PetriNetUnfolderBase]: For 675/678 co-relation queries the response was YES. [2023-08-26 15:24:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 455 events. 233/455 cut-off events. For 675/678 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2004 event pairs, 73 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1626. Up to 190 conditions per place. [2023-08-26 15:24:34,341 INFO L140 encePairwiseOnDemand]: 311/317 looper letters, 43 selfloop transitions, 6 changer transitions 23/73 dead transitions. [2023-08-26 15:24:34,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 537 flow [2023-08-26 15:24:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:24:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:24:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-08-26 15:24:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35646687697160884 [2023-08-26 15:24:34,344 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-08-26 15:24:34,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-08-26 15:24:34,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:34,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-08-26 15:24:34,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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 15:24:34,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:34,348 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:34,348 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 188 flow. Second operand 6 states and 678 transitions. [2023-08-26 15:24:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 537 flow [2023-08-26 15:24:34,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 510 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-08-26 15:24:34,352 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 192 flow [2023-08-26 15:24:34,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-08-26 15:24:34,353 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -27 predicate places. [2023-08-26 15:24:34,353 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 192 flow [2023-08-26 15:24:34,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 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 15:24:34,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:34,354 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] [2023-08-26 15:24:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:24:34,354 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:34,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash -206131317, now seen corresponding path program 3 times [2023-08-26 15:24:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102673253] [2023-08-26 15:24:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:34,604 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 15:24:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102673253] [2023-08-26 15:24:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102673253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:24:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70134082] [2023-08-26 15:24:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:34,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:24:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:24:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:24:34,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 317 [2023-08-26 15:24:34,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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 15:24:34,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:34,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 317 [2023-08-26 15:24:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:34,765 INFO L124 PetriNetUnfolderBase]: 298/570 cut-off events. [2023-08-26 15:24:34,766 INFO L125 PetriNetUnfolderBase]: For 1081/1081 co-relation queries the response was YES. [2023-08-26 15:24:34,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 570 events. 298/570 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2657 event pairs, 26 based on Foata normal form. 2/572 useless extension candidates. Maximal degree in co-relation 2117. Up to 335 conditions per place. [2023-08-26 15:24:34,768 INFO L140 encePairwiseOnDemand]: 314/317 looper letters, 40 selfloop transitions, 1 changer transitions 28/69 dead transitions. [2023-08-26 15:24:34,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 523 flow [2023-08-26 15:24:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:24:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:24:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-26 15:24:34,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40930599369085174 [2023-08-26 15:24:34,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-26 15:24:34,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-26 15:24:34,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:34,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-26 15:24:34,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 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 15:24:34,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:34,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 states have internal predecessors, (1585), 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 15:24:34,774 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 192 flow. Second operand 4 states and 519 transitions. [2023-08-26 15:24:34,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 523 flow [2023-08-26 15:24:34,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 504 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 15:24:34,778 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 188 flow [2023-08-26 15:24:34,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2023-08-26 15:24:34,778 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -28 predicate places. [2023-08-26 15:24:34,779 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 188 flow [2023-08-26 15:24:34,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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 15:24:34,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:34,779 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] [2023-08-26 15:24:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:24:34,779 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:34,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 368853065, now seen corresponding path program 4 times [2023-08-26 15:24:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199715322] [2023-08-26 15:24:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:37,264 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 15:24:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:37,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199715322] [2023-08-26 15:24:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199715322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:24:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112272056] [2023-08-26 15:24:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:24:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:24:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:24:37,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 317 [2023-08-26 15:24:37,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 188 flow. Second operand has 11 states, 11 states have (on average 86.81818181818181) internal successors, (955), 11 states have internal predecessors, (955), 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 15:24:37,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:37,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 317 [2023-08-26 15:24:37,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:37,693 INFO L124 PetriNetUnfolderBase]: 293/581 cut-off events. [2023-08-26 15:24:37,693 INFO L125 PetriNetUnfolderBase]: For 1130/1132 co-relation queries the response was YES. [2023-08-26 15:24:37,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 581 events. 293/581 cut-off events. For 1130/1132 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2741 event pairs, 62 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 2176. Up to 210 conditions per place. [2023-08-26 15:24:37,695 INFO L140 encePairwiseOnDemand]: 310/317 looper letters, 42 selfloop transitions, 5 changer transitions 34/82 dead transitions. [2023-08-26 15:24:37,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 608 flow [2023-08-26 15:24:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:24:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:24:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 650 transitions. [2023-08-26 15:24:37,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2929247408742677 [2023-08-26 15:24:37,698 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 650 transitions. [2023-08-26 15:24:37,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 650 transitions. [2023-08-26 15:24:37,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:37,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 650 transitions. [2023-08-26 15:24:37,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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 15:24:37,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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 15:24:37,704 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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 15:24:37,704 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 188 flow. Second operand 7 states and 650 transitions. [2023-08-26 15:24:37,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 608 flow [2023-08-26 15:24:37,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 600 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:37,708 INFO L231 Difference]: Finished difference. Result has 60 places, 32 transitions, 190 flow [2023-08-26 15:24:37,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=60, PETRI_TRANSITIONS=32} [2023-08-26 15:24:37,709 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -22 predicate places. [2023-08-26 15:24:37,709 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 32 transitions, 190 flow [2023-08-26 15:24:37,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.81818181818181) internal successors, (955), 11 states have internal predecessors, (955), 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 15:24:37,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:37,710 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] [2023-08-26 15:24:37,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:24:37,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:37,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash -387696269, now seen corresponding path program 5 times [2023-08-26 15:24:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181227709] [2023-08-26 15:24:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:38,364 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 15:24:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181227709] [2023-08-26 15:24:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181227709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207864597] [2023-08-26 15:24:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:38,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:24:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:24:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:24:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 317 [2023-08-26 15:24:38,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 32 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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 15:24:38,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 317 [2023-08-26 15:24:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:38,546 INFO L124 PetriNetUnfolderBase]: 243/509 cut-off events. [2023-08-26 15:24:38,546 INFO L125 PetriNetUnfolderBase]: For 995/997 co-relation queries the response was YES. [2023-08-26 15:24:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 509 events. 243/509 cut-off events. For 995/997 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2452 event pairs, 47 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 1994. Up to 252 conditions per place. [2023-08-26 15:24:38,548 INFO L140 encePairwiseOnDemand]: 310/317 looper letters, 38 selfloop transitions, 7 changer transitions 30/76 dead transitions. [2023-08-26 15:24:38,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 566 flow [2023-08-26 15:24:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:24:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:24:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-08-26 15:24:38,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659305993690852 [2023-08-26 15:24:38,550 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-08-26 15:24:38,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-08-26 15:24:38,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:38,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-08-26 15:24:38,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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 15:24:38,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:38,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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 15:24:38,555 INFO L175 Difference]: Start difference. First operand has 60 places, 32 transitions, 190 flow. Second operand 6 states and 696 transitions. [2023-08-26 15:24:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 566 flow [2023-08-26 15:24:38,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 538 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-08-26 15:24:38,560 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 204 flow [2023-08-26 15:24:38,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2023-08-26 15:24:38,561 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2023-08-26 15:24:38,561 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 204 flow [2023-08-26 15:24:38,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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 15:24:38,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:38,562 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] [2023-08-26 15:24:38,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:24:38,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:38,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -618128515, now seen corresponding path program 6 times [2023-08-26 15:24:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:38,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024050151] [2023-08-26 15:24:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:39,819 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 15:24:39,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024050151] [2023-08-26 15:24:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024050151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:39,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:39,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:24:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556856008] [2023-08-26 15:24:39,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:39,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:24:39,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:24:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:24:39,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 317 [2023-08-26 15:24:39,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 204 flow. Second operand has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 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 15:24:39,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:39,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 317 [2023-08-26 15:24:39,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:40,053 INFO L124 PetriNetUnfolderBase]: 182/393 cut-off events. [2023-08-26 15:24:40,053 INFO L125 PetriNetUnfolderBase]: For 838/842 co-relation queries the response was YES. [2023-08-26 15:24:40,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 393 events. 182/393 cut-off events. For 838/842 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1710 event pairs, 79 based on Foata normal form. 3/394 useless extension candidates. Maximal degree in co-relation 1598. Up to 135 conditions per place. [2023-08-26 15:24:40,055 INFO L140 encePairwiseOnDemand]: 311/317 looper letters, 40 selfloop transitions, 6 changer transitions 20/67 dead transitions. [2023-08-26 15:24:40,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 524 flow [2023-08-26 15:24:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:24:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:24:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2023-08-26 15:24:40,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3470031545741325 [2023-08-26 15:24:40,058 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2023-08-26 15:24:40,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2023-08-26 15:24:40,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:40,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2023-08-26 15:24:40,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:40,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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 15:24:40,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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 15:24:40,063 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 204 flow. Second operand 7 states and 770 transitions. [2023-08-26 15:24:40,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 524 flow [2023-08-26 15:24:40,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 502 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-26 15:24:40,067 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 204 flow [2023-08-26 15:24:40,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-08-26 15:24:40,067 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -24 predicate places. [2023-08-26 15:24:40,068 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 204 flow [2023-08-26 15:24:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 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 15:24:40,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:40,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:40,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:24:40,069 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 15:24:40,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash 447405585, now seen corresponding path program 7 times [2023-08-26 15:24:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:40,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064743950] [2023-08-26 15:24:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:24:40,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:24:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:24:40,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:24:40,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:24:40,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (83 of 84 remaining) [2023-08-26 15:24:40,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 84 remaining) [2023-08-26 15:24:40,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 84 remaining) [2023-08-26 15:24:40,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 84 remaining) [2023-08-26 15:24:40,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 84 remaining) [2023-08-26 15:24:40,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 84 remaining) [2023-08-26 15:24:40,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 84 remaining) [2023-08-26 15:24:40,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 84 remaining) [2023-08-26 15:24:40,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 84 remaining) [2023-08-26 15:24:40,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 84 remaining) [2023-08-26 15:24:40,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 84 remaining) [2023-08-26 15:24:40,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 84 remaining) [2023-08-26 15:24:40,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 84 remaining) [2023-08-26 15:24:40,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 84 remaining) [2023-08-26 15:24:40,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 84 remaining) [2023-08-26 15:24:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:24:40,267 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:40,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:24:40,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:24:40,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:24:40 BasicIcfg [2023-08-26 15:24:40,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:24:40,343 INFO L158 Benchmark]: Toolchain (without parser) took 33624.31ms. Allocated memory was 360.7MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 335.7MB in the beginning and 1.2GB in the end (delta: -842.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 15:24:40,343 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 360.7MB. Free memory is still 338.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:24:40,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.34ms. Allocated memory is still 360.7MB. Free memory was 335.7MB in the beginning and 311.4MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:24:40,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.87ms. Allocated memory is still 360.7MB. Free memory was 311.3MB in the beginning and 308.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:24:40,344 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 360.7MB. Free memory was 308.8MB in the beginning and 306.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:24:40,344 INFO L158 Benchmark]: RCFGBuilder took 965.48ms. Allocated memory is still 360.7MB. Free memory was 306.3MB in the beginning and 245.1MB in the end (delta: 61.2MB). Peak memory consumption was 62.0MB. Max. memory is 16.0GB. [2023-08-26 15:24:40,344 INFO L158 Benchmark]: TraceAbstraction took 31963.77ms. Allocated memory was 360.7MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 245.1MB in the beginning and 1.2GB in the end (delta: -932.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 15:24:40,345 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.13ms. Allocated memory is still 360.7MB. Free memory is still 338.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 573.34ms. Allocated memory is still 360.7MB. Free memory was 335.7MB in the beginning and 311.4MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.87ms. Allocated memory is still 360.7MB. Free memory was 311.3MB in the beginning and 308.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 360.7MB. Free memory was 308.8MB in the beginning and 306.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 965.48ms. Allocated memory is still 360.7MB. Free memory was 306.3MB in the beginning and 245.1MB in the end (delta: 61.2MB). Peak memory consumption was 62.0MB. Max. memory is 16.0GB. * TraceAbstraction took 31963.77ms. Allocated memory was 360.7MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 245.1MB in the beginning and 1.2GB in the end (delta: -932.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 178 PlacesBefore, 82 PlacesAfterwards, 171 TransitionsBefore, 73 TransitionsAfterwards, 6810 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 39131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11245, independent: 10548, independent conditional: 0, independent unconditional: 10548, dependent: 697, dependent conditional: 0, dependent unconditional: 697, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2977, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11245, independent: 7656, independent conditional: 0, independent unconditional: 7656, dependent: 612, dependent conditional: 0, dependent unconditional: 612, unknown: 2977, unknown conditional: 0, unknown unconditional: 2977] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 477, Positive conditional cache size: 0, Positive unconditional cache size: 477, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461, ((void *)0), P0, ((void *)0))=-1, t2461={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462, ((void *)0), P1, ((void *)0))=0, t2461={6:0}, t2462={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t2463; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={7:0}, t2463={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463, ((void *)0), P2, ((void *)0))=1, t2461={6:0}, t2462={7:0}, t2463={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, t2461={6:0}, t2462={7:0}, t2463={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: -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: -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: -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: -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: 856]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 231 locations, 84 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: 31.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1933 IncrementalHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 2 mSDtfsCounter, 1933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=10, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 15:24:40,365 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...