/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 PROGRAM_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/safe015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:23:43,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:23:44,034 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 18:23:44,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:23:44,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:23:44,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:23:44,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:23:44,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:23:44,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:23:44,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:23:44,085 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:23:44,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:23:44,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:23:44,087 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:23:44,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:23:44,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:23:44,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:23:44,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:23:44,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:23:44,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:23:44,088 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:23:44,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:23:44,089 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:23:44,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:23:44,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:23:44,090 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:23:44,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:23:44,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:44,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:23:44,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:23:44,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:23:44,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:23:44,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:23:44,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:23:44,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:23:44,093 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 -> PROGRAM_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 18:23:44,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:23:44,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:23:44,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:23:44,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:23:44,445 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:23:44,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2023-08-26 18:23:45,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:23:45,957 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:23:45,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2023-08-26 18:23:45,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82ff1199/abc74ab71b6d4a259434ed8a662feadb/FLAG2ef6ee096 [2023-08-26 18:23:45,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82ff1199/abc74ab71b6d4a259434ed8a662feadb [2023-08-26 18:23:46,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:23:46,005 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:23:46,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:46,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:23:46,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:23:46,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:45" (1/1) ... [2023-08-26 18:23:46,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a702b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46, skipping insertion in model container [2023-08-26 18:23:46,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:23:45" (1/1) ... [2023-08-26 18:23:46,067 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:23:46,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:46,414 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:23:46,432 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:46,434 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:23:46,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:23:46,509 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:46,509 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:23:46,515 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:23:46,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46 WrapperNode [2023-08-26 18:23:46,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:23:46,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:46,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:23:46,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:23:46,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,572 INFO L138 Inliner]: procedures = 176, calls = 87, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-08-26 18:23:46,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:23:46,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:23:46,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:23:46,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:23:46,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:23:46,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:23:46,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:23:46,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:23:46,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (1/1) ... [2023-08-26 18:23:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:23:46,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:23:46,645 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 18:23:46,657 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 18:23:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:23:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:23:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:23:46,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:23:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:23:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:23:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:23:46,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:23:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:23:46,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:23:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:23:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:23:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:23:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:23:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:23:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:23:46,683 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 18:23:46,839 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:23:46,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:23:47,477 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:23:48,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:23:48,301 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:23:48,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:48 BoogieIcfgContainer [2023-08-26 18:23:48,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:23:48,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:23:48,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:23:48,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:23:48,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:23:45" (1/3) ... [2023-08-26 18:23:48,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2860cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:48, skipping insertion in model container [2023-08-26 18:23:48,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:23:46" (2/3) ... [2023-08-26 18:23:48,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2860cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:23:48, skipping insertion in model container [2023-08-26 18:23:48,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:23:48" (3/3) ... [2023-08-26 18:23:48,312 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2023-08-26 18:23:48,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:23:48,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-08-26 18:23:48,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:23:48,507 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:23:48,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 192 transitions, 399 flow [2023-08-26 18:23:48,649 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-08-26 18:23:48,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:48,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 388 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2023-08-26 18:23:48,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 192 transitions, 399 flow [2023-08-26 18:23:48,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 189 transitions, 387 flow [2023-08-26 18:23:48,669 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:23:48,680 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 189 transitions, 387 flow [2023-08-26 18:23:48,684 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 189 transitions, 387 flow [2023-08-26 18:23:48,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 387 flow [2023-08-26 18:23:48,763 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-08-26 18:23:48,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:23:48,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 385 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2023-08-26 18:23:48,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 9360 [2023-08-26 18:24:11,617 INFO L134 LiptonReduction]: Checked pairs total: 68301 [2023-08-26 18:24:11,617 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-26 18:24:11,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:24:11,641 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;@1ec0ee12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:24:11,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2023-08-26 18:24:11,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:24:11,643 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:24:11,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:24:11,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:11,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:24:11,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:11,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1371, now seen corresponding path program 1 times [2023-08-26 18:24:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275963528] [2023-08-26 18:24:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:11,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:11,774 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 18:24:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275963528] [2023-08-26 18:24:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275963528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:24:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925922323] [2023-08-26 18:24:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:11,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:24:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:24:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:24:11,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 343 [2023-08-26 18:24:11,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 193 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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 18:24:11,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:11,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 343 [2023-08-26 18:24:11,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:17,162 INFO L124 PetriNetUnfolderBase]: 25008/34885 cut-off events. [2023-08-26 18:24:17,162 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 18:24:17,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69831 conditions, 34885 events. 25008/34885 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2843. Compared 244704 event pairs, 25008 based on Foata normal form. 0/14513 useless extension candidates. Maximal degree in co-relation 69820. Up to 34808 conditions per place. [2023-08-26 18:24:17,392 INFO L140 encePairwiseOnDemand]: 302/343 looper letters, 46 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 18:24:17,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 201 flow [2023-08-26 18:24:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:24:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:24:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-26 18:24:17,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912536443148688 [2023-08-26 18:24:17,409 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-26 18:24:17,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-26 18:24:17,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:17,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-26 18:24:17,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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 18:24:17,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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 18:24:17,422 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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 18:24:17,424 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 193 flow. Second operand 2 states and 337 transitions. [2023-08-26 18:24:17,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 201 flow [2023-08-26 18:24:17,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:24:17,433 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 18:24:17,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 18:24:17,438 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -43 predicate places. [2023-08-26 18:24:17,438 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 18:24:17,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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 18:24:17,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:17,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 18:24:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:24:17,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:17,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 41962850, now seen corresponding path program 1 times [2023-08-26 18:24:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812325098] [2023-08-26 18:24:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:17,652 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 18:24:17,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:17,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812325098] [2023-08-26 18:24:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812325098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:17,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:24:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543056658] [2023-08-26 18:24:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:17,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 343 [2023-08-26 18:24:17,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 18:24:17,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:17,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 343 [2023-08-26 18:24:17,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:20,777 INFO L124 PetriNetUnfolderBase]: 16907/24807 cut-off events. [2023-08-26 18:24:20,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:24:20,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49440 conditions, 24807 events. 16907/24807 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1601. Compared 168962 event pairs, 11405 based on Foata normal form. 0/14188 useless extension candidates. Maximal degree in co-relation 49437. Up to 16515 conditions per place. [2023-08-26 18:24:20,911 INFO L140 encePairwiseOnDemand]: 322/343 looper letters, 56 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2023-08-26 18:24:20,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 272 flow [2023-08-26 18:24:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-26 18:24:20,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369290573372206 [2023-08-26 18:24:20,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-26 18:24:20,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-26 18:24:20,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:20,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-26 18:24:20,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 18:24:20,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:20,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:20,926 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 380 transitions. [2023-08-26 18:24:20,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 272 flow [2023-08-26 18:24:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:24:20,931 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 188 flow [2023-08-26 18:24:20,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 18:24:20,932 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -42 predicate places. [2023-08-26 18:24:20,933 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 188 flow [2023-08-26 18:24:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 18:24:20,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:20,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 18:24:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:24:20,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:20,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash 41962851, now seen corresponding path program 1 times [2023-08-26 18:24:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:20,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674824596] [2023-08-26 18:24:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:21,088 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 18:24:21,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:21,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674824596] [2023-08-26 18:24:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674824596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:21,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:24:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918170427] [2023-08-26 18:24:21,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:21,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:21,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:21,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 343 [2023-08-26 18:24:21,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 18:24:21,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:21,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 343 [2023-08-26 18:24:21,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:22,386 INFO L124 PetriNetUnfolderBase]: 4418/6936 cut-off events. [2023-08-26 18:24:22,386 INFO L125 PetriNetUnfolderBase]: For 2348/2348 co-relation queries the response was YES. [2023-08-26 18:24:22,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19569 conditions, 6936 events. 4418/6936 cut-off events. For 2348/2348 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 42688 event pairs, 3275 based on Foata normal form. 2197/8633 useless extension candidates. Maximal degree in co-relation 19564. Up to 6761 conditions per place. [2023-08-26 18:24:22,421 INFO L140 encePairwiseOnDemand]: 331/343 looper letters, 42 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-26 18:24:22,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 252 flow [2023-08-26 18:24:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 18:24:22,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35082604470359574 [2023-08-26 18:24:22,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 18:24:22,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 18:24:22,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:22,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 18:24:22,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 18:24:22,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:22,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:22,428 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 188 flow. Second operand 3 states and 361 transitions. [2023-08-26 18:24:22,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 252 flow [2023-08-26 18:24:22,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:22,445 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 148 flow [2023-08-26 18:24:22,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-26 18:24:22,446 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -53 predicate places. [2023-08-26 18:24:22,446 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 148 flow [2023-08-26 18:24:22,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 18:24:22,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:22,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:22,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:24:22,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:22,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 68861701, now seen corresponding path program 1 times [2023-08-26 18:24:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698909897] [2023-08-26 18:24:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:22,709 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 18:24:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698909897] [2023-08-26 18:24:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698909897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:24:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544876911] [2023-08-26 18:24:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:22,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 343 [2023-08-26 18:24:22,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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 18:24:22,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:22,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 343 [2023-08-26 18:24:22,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:23,724 INFO L124 PetriNetUnfolderBase]: 4143/6618 cut-off events. [2023-08-26 18:24:23,724 INFO L125 PetriNetUnfolderBase]: For 1096/1164 co-relation queries the response was YES. [2023-08-26 18:24:23,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17101 conditions, 6618 events. 4143/6618 cut-off events. For 1096/1164 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 42227 event pairs, 1459 based on Foata normal form. 0/5343 useless extension candidates. Maximal degree in co-relation 17096. Up to 4700 conditions per place. [2023-08-26 18:24:23,757 INFO L140 encePairwiseOnDemand]: 339/343 looper letters, 59 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-26 18:24:23,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 346 flow [2023-08-26 18:24:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-26 18:24:23,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41205053449951407 [2023-08-26 18:24:23,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-26 18:24:23,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-26 18:24:23,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:23,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-26 18:24:23,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 18:24:23,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:23,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:23,764 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 148 flow. Second operand 3 states and 424 transitions. [2023-08-26 18:24:23,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 346 flow [2023-08-26 18:24:23,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:24:23,766 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 160 flow [2023-08-26 18:24:23,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:24:23,767 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -51 predicate places. [2023-08-26 18:24:23,767 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 160 flow [2023-08-26 18:24:23,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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 18:24:23,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:23,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:23,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:24:23,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:23,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 68861999, now seen corresponding path program 1 times [2023-08-26 18:24:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192322907] [2023-08-26 18:24:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:23,999 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 18:24:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192322907] [2023-08-26 18:24:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192322907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:24:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110251546] [2023-08-26 18:24:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:24,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:24,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 343 [2023-08-26 18:24:24,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 160 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 18:24:24,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:24,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 343 [2023-08-26 18:24:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:25,220 INFO L124 PetriNetUnfolderBase]: 5034/7689 cut-off events. [2023-08-26 18:24:25,221 INFO L125 PetriNetUnfolderBase]: For 2017/2157 co-relation queries the response was YES. [2023-08-26 18:24:25,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20860 conditions, 7689 events. 5034/7689 cut-off events. For 2017/2157 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 46979 event pairs, 1947 based on Foata normal form. 20/6439 useless extension candidates. Maximal degree in co-relation 20854. Up to 7022 conditions per place. [2023-08-26 18:24:25,246 INFO L140 encePairwiseOnDemand]: 339/343 looper letters, 67 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-26 18:24:25,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 402 flow [2023-08-26 18:24:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 18:24:25,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413022351797862 [2023-08-26 18:24:25,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 18:24:25,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 18:24:25,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:25,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 18:24:25,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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 18:24:25,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:25,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:25,253 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 160 flow. Second operand 3 states and 425 transitions. [2023-08-26 18:24:25,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 402 flow [2023-08-26 18:24:25,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:25,257 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 173 flow [2023-08-26 18:24:25,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-26 18:24:25,259 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -50 predicate places. [2023-08-26 18:24:25,259 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 173 flow [2023-08-26 18:24:25,259 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 18:24:25,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:25,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:25,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:24:25,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:25,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2134721339, now seen corresponding path program 1 times [2023-08-26 18:24:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419031101] [2023-08-26 18:24:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:25,709 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 18:24:25,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:25,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419031101] [2023-08-26 18:24:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419031101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:25,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:25,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:24:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916026904] [2023-08-26 18:24:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:25,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:24:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:24:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:24:25,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 343 [2023-08-26 18:24:25,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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 18:24:25,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:25,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 343 [2023-08-26 18:24:25,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:26,661 INFO L124 PetriNetUnfolderBase]: 4676/7273 cut-off events. [2023-08-26 18:24:26,661 INFO L125 PetriNetUnfolderBase]: For 1764/1764 co-relation queries the response was YES. [2023-08-26 18:24:26,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20604 conditions, 7273 events. 4676/7273 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 44907 event pairs, 1129 based on Foata normal form. 15/6055 useless extension candidates. Maximal degree in co-relation 20597. Up to 5569 conditions per place. [2023-08-26 18:24:26,686 INFO L140 encePairwiseOnDemand]: 338/343 looper letters, 79 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2023-08-26 18:24:26,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 509 flow [2023-08-26 18:24:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:24:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:24:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-26 18:24:26,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34110787172011664 [2023-08-26 18:24:26,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-26 18:24:26,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-26 18:24:26,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:26,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-26 18:24:26,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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 18:24:26,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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 18:24:26,694 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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 18:24:26,694 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 173 flow. Second operand 4 states and 468 transitions. [2023-08-26 18:24:26,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 509 flow [2023-08-26 18:24:26,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:24:26,696 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 215 flow [2023-08-26 18:24:26,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-26 18:24:26,697 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -47 predicate places. [2023-08-26 18:24:26,697 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 215 flow [2023-08-26 18:24:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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 18:24:26,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:26,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:26,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:24:26,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:26,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2134720793, now seen corresponding path program 1 times [2023-08-26 18:24:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838006196] [2023-08-26 18:24:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:26,994 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 18:24:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838006196] [2023-08-26 18:24:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838006196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:26,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:24:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684720065] [2023-08-26 18:24:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:26,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 343 [2023-08-26 18:24:26,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 18:24:26,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:26,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 343 [2023-08-26 18:24:26,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:28,090 INFO L124 PetriNetUnfolderBase]: 5290/8286 cut-off events. [2023-08-26 18:24:28,090 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2023-08-26 18:24:28,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24554 conditions, 8286 events. 5290/8286 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 52282 event pairs, 1950 based on Foata normal form. 0/7160 useless extension candidates. Maximal degree in co-relation 24546. Up to 5835 conditions per place. [2023-08-26 18:24:28,120 INFO L140 encePairwiseOnDemand]: 338/343 looper letters, 56 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2023-08-26 18:24:28,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 391 flow [2023-08-26 18:24:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-26 18:24:28,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2023-08-26 18:24:28,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-26 18:24:28,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-26 18:24:28,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:28,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-26 18:24:28,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:24:28,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:28,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:28,126 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 215 flow. Second operand 3 states and 350 transitions. [2023-08-26 18:24:28,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 391 flow [2023-08-26 18:24:28,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:24:28,128 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 247 flow [2023-08-26 18:24:28,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-26 18:24:28,129 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -46 predicate places. [2023-08-26 18:24:28,129 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 247 flow [2023-08-26 18:24:28,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 18:24:28,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:28,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:28,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:24:28,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:28,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2134720794, now seen corresponding path program 1 times [2023-08-26 18:24:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614426521] [2023-08-26 18:24:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:28,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 18:24:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614426521] [2023-08-26 18:24:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614426521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:24:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638405112] [2023-08-26 18:24:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:28,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:24:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:24:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:24:28,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 343 [2023-08-26 18:24:28,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 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 18:24:28,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:28,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 343 [2023-08-26 18:24:28,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:30,189 INFO L124 PetriNetUnfolderBase]: 5521/8710 cut-off events. [2023-08-26 18:24:30,190 INFO L125 PetriNetUnfolderBase]: For 6357/6357 co-relation queries the response was YES. [2023-08-26 18:24:30,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26949 conditions, 8710 events. 5521/8710 cut-off events. For 6357/6357 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 56982 event pairs, 327 based on Foata normal form. 90/7718 useless extension candidates. Maximal degree in co-relation 26940. Up to 3052 conditions per place. [2023-08-26 18:24:30,224 INFO L140 encePairwiseOnDemand]: 323/343 looper letters, 100 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2023-08-26 18:24:30,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 836 flow [2023-08-26 18:24:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:24:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:24:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1083 transitions. [2023-08-26 18:24:30,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31574344023323614 [2023-08-26 18:24:30,228 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1083 transitions. [2023-08-26 18:24:30,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1083 transitions. [2023-08-26 18:24:30,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:30,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1083 transitions. [2023-08-26 18:24:30,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.3) internal successors, (1083), 10 states have internal predecessors, (1083), 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 18:24:30,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 343.0) internal successors, (3773), 11 states have internal predecessors, (3773), 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 18:24:30,237 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 343.0) internal successors, (3773), 11 states have internal predecessors, (3773), 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 18:24:30,237 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 247 flow. Second operand 10 states and 1083 transitions. [2023-08-26 18:24:30,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 836 flow [2023-08-26 18:24:30,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 139 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:30,252 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 486 flow [2023-08-26 18:24:30,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=486, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2023-08-26 18:24:30,252 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -38 predicate places. [2023-08-26 18:24:30,253 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 486 flow [2023-08-26 18:24:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 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 18:24:30,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:30,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:30,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:24:30,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:30,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 289180767, now seen corresponding path program 1 times [2023-08-26 18:24:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021910426] [2023-08-26 18:24:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:33,190 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 18:24:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021910426] [2023-08-26 18:24:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021910426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:24:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014998864] [2023-08-26 18:24:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:24:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:24:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:24:33,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 343 [2023-08-26 18:24:33,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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 18:24:33,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 343 [2023-08-26 18:24:33,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:34,579 INFO L124 PetriNetUnfolderBase]: 5711/8911 cut-off events. [2023-08-26 18:24:34,579 INFO L125 PetriNetUnfolderBase]: For 11588/11592 co-relation queries the response was YES. [2023-08-26 18:24:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33311 conditions, 8911 events. 5711/8911 cut-off events. For 11588/11592 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 56777 event pairs, 1886 based on Foata normal form. 18/8552 useless extension candidates. Maximal degree in co-relation 33301. Up to 7264 conditions per place. [2023-08-26 18:24:34,618 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 128 selfloop transitions, 23 changer transitions 0/153 dead transitions. [2023-08-26 18:24:34,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 153 transitions, 1237 flow [2023-08-26 18:24:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:24:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:24:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 709 transitions. [2023-08-26 18:24:34,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29529362765514366 [2023-08-26 18:24:34,620 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 709 transitions. [2023-08-26 18:24:34,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 709 transitions. [2023-08-26 18:24:34,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:34,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 709 transitions. [2023-08-26 18:24:34,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 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 18:24:34,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:34,626 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:34,626 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 486 flow. Second operand 7 states and 709 transitions. [2023-08-26 18:24:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 153 transitions, 1237 flow [2023-08-26 18:24:34,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 153 transitions, 1200 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 18:24:34,681 INFO L231 Difference]: Finished difference. Result has 69 places, 91 transitions, 644 flow [2023-08-26 18:24:34,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=644, PETRI_PLACES=69, PETRI_TRANSITIONS=91} [2023-08-26 18:24:34,682 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -32 predicate places. [2023-08-26 18:24:34,682 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 91 transitions, 644 flow [2023-08-26 18:24:34,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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 18:24:34,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:34,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:34,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:24:34,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:34,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1751922032, now seen corresponding path program 1 times [2023-08-26 18:24:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640238653] [2023-08-26 18:24:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:34,788 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 18:24:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640238653] [2023-08-26 18:24:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640238653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:24:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124658827] [2023-08-26 18:24:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:34,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:24:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:34,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:24:34,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:24:34,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 343 [2023-08-26 18:24:34,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 91 transitions, 644 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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 18:24:34,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:34,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 343 [2023-08-26 18:24:34,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:35,818 INFO L124 PetriNetUnfolderBase]: 4391/6866 cut-off events. [2023-08-26 18:24:35,819 INFO L125 PetriNetUnfolderBase]: For 9269/9285 co-relation queries the response was YES. [2023-08-26 18:24:35,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26265 conditions, 6866 events. 4391/6866 cut-off events. For 9269/9285 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 41685 event pairs, 1254 based on Foata normal form. 137/6738 useless extension candidates. Maximal degree in co-relation 26252. Up to 2763 conditions per place. [2023-08-26 18:24:35,851 INFO L140 encePairwiseOnDemand]: 325/343 looper letters, 66 selfloop transitions, 38 changer transitions 0/106 dead transitions. [2023-08-26 18:24:35,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 905 flow [2023-08-26 18:24:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:24:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:24:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 18:24:35,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33090379008746357 [2023-08-26 18:24:35,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 18:24:35,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 18:24:35,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:35,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 18:24:35,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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 18:24:35,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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 18:24:35,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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 18:24:35,857 INFO L175 Difference]: Start difference. First operand has 69 places, 91 transitions, 644 flow. Second operand 4 states and 454 transitions. [2023-08-26 18:24:35,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 905 flow [2023-08-26 18:24:35,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 106 transitions, 886 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:35,923 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 754 flow [2023-08-26 18:24:35,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2023-08-26 18:24:35,924 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -30 predicate places. [2023-08-26 18:24:35,924 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 754 flow [2023-08-26 18:24:35,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 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 18:24:35,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:35,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:35,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:24:35,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:35,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 783228015, now seen corresponding path program 1 times [2023-08-26 18:24:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:35,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738609563] [2023-08-26 18:24:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:37,218 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 18:24:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738609563] [2023-08-26 18:24:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738609563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:24:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415993866] [2023-08-26 18:24:37,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:37,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:24:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:24:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:24:37,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 343 [2023-08-26 18:24:37,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 754 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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 18:24:37,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:37,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 343 [2023-08-26 18:24:37,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:38,569 INFO L124 PetriNetUnfolderBase]: 5755/8884 cut-off events. [2023-08-26 18:24:38,570 INFO L125 PetriNetUnfolderBase]: For 18468/18526 co-relation queries the response was YES. [2023-08-26 18:24:38,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37603 conditions, 8884 events. 5755/8884 cut-off events. For 18468/18526 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 55015 event pairs, 2253 based on Foata normal form. 70/8635 useless extension candidates. Maximal degree in co-relation 37589. Up to 7003 conditions per place. [2023-08-26 18:24:38,615 INFO L140 encePairwiseOnDemand]: 326/343 looper letters, 124 selfloop transitions, 76 changer transitions 0/202 dead transitions. [2023-08-26 18:24:38,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 202 transitions, 2029 flow [2023-08-26 18:24:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:24:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:24:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 734 transitions. [2023-08-26 18:24:38,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30570595585172844 [2023-08-26 18:24:38,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 734 transitions. [2023-08-26 18:24:38,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 734 transitions. [2023-08-26 18:24:38,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:38,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 734 transitions. [2023-08-26 18:24:38,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 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 18:24:38,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:38,625 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:38,626 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 754 flow. Second operand 7 states and 734 transitions. [2023-08-26 18:24:38,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 202 transitions, 2029 flow [2023-08-26 18:24:38,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 202 transitions, 2020 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:24:38,716 INFO L231 Difference]: Finished difference. Result has 80 places, 154 transitions, 1688 flow [2023-08-26 18:24:38,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1688, PETRI_PLACES=80, PETRI_TRANSITIONS=154} [2023-08-26 18:24:38,717 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -21 predicate places. [2023-08-26 18:24:38,717 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 154 transitions, 1688 flow [2023-08-26 18:24:38,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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 18:24:38,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:38,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:24:38,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:38,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1435760383, now seen corresponding path program 2 times [2023-08-26 18:24:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688229325] [2023-08-26 18:24:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:40,033 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 18:24:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688229325] [2023-08-26 18:24:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688229325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:24:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969611206] [2023-08-26 18:24:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:24:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:24:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:24:40,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 343 [2023-08-26 18:24:40,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 154 transitions, 1688 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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 18:24:40,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:40,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 343 [2023-08-26 18:24:40,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:41,854 INFO L124 PetriNetUnfolderBase]: 6197/9982 cut-off events. [2023-08-26 18:24:41,854 INFO L125 PetriNetUnfolderBase]: For 33195/33259 co-relation queries the response was YES. [2023-08-26 18:24:41,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47730 conditions, 9982 events. 6197/9982 cut-off events. For 33195/33259 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 68204 event pairs, 595 based on Foata normal form. 345/10005 useless extension candidates. Maximal degree in co-relation 47711. Up to 3835 conditions per place. [2023-08-26 18:24:41,908 INFO L140 encePairwiseOnDemand]: 323/343 looper letters, 151 selfloop transitions, 151 changer transitions 25/329 dead transitions. [2023-08-26 18:24:41,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 329 transitions, 3769 flow [2023-08-26 18:24:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:24:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:24:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1333 transitions. [2023-08-26 18:24:41,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2989459520071765 [2023-08-26 18:24:41,912 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1333 transitions. [2023-08-26 18:24:41,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1333 transitions. [2023-08-26 18:24:41,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:41,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1333 transitions. [2023-08-26 18:24:41,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 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 18:24:41,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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 18:24:41,920 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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 18:24:41,920 INFO L175 Difference]: Start difference. First operand has 80 places, 154 transitions, 1688 flow. Second operand 13 states and 1333 transitions. [2023-08-26 18:24:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 329 transitions, 3769 flow [2023-08-26 18:24:42,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 329 transitions, 3740 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-26 18:24:42,177 INFO L231 Difference]: Finished difference. Result has 98 places, 203 transitions, 2807 flow [2023-08-26 18:24:42,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2807, PETRI_PLACES=98, PETRI_TRANSITIONS=203} [2023-08-26 18:24:42,178 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -3 predicate places. [2023-08-26 18:24:42,178 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2807 flow [2023-08-26 18:24:42,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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 18:24:42,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:42,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:24:42,179 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:42,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1524989976, now seen corresponding path program 1 times [2023-08-26 18:24:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502217680] [2023-08-26 18:24:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:42,338 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 18:24:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502217680] [2023-08-26 18:24:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502217680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:24:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130259796] [2023-08-26 18:24:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:24:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:24:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:24:42,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 343 [2023-08-26 18:24:42,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 203 transitions, 2807 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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 18:24:42,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:42,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 343 [2023-08-26 18:24:42,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:43,697 INFO L124 PetriNetUnfolderBase]: 4427/7193 cut-off events. [2023-08-26 18:24:43,697 INFO L125 PetriNetUnfolderBase]: For 42437/42449 co-relation queries the response was YES. [2023-08-26 18:24:43,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37980 conditions, 7193 events. 4427/7193 cut-off events. For 42437/42449 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 46114 event pairs, 700 based on Foata normal form. 197/7217 useless extension candidates. Maximal degree in co-relation 37954. Up to 2975 conditions per place. [2023-08-26 18:24:43,726 INFO L140 encePairwiseOnDemand]: 324/343 looper letters, 109 selfloop transitions, 59 changer transitions 67/237 dead transitions. [2023-08-26 18:24:43,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 237 transitions, 3472 flow [2023-08-26 18:24:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:24:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:24:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 650 transitions. [2023-08-26 18:24:43,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31584062196307094 [2023-08-26 18:24:43,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 650 transitions. [2023-08-26 18:24:43,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 650 transitions. [2023-08-26 18:24:43,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:43,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 650 transitions. [2023-08-26 18:24:43,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 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 18:24:43,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 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 18:24:43,733 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 343.0) internal successors, (2401), 7 states have internal predecessors, (2401), 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 18:24:43,733 INFO L175 Difference]: Start difference. First operand has 98 places, 203 transitions, 2807 flow. Second operand 6 states and 650 transitions. [2023-08-26 18:24:43,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 237 transitions, 3472 flow [2023-08-26 18:24:43,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 237 transitions, 3197 flow, removed 38 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:43,923 INFO L231 Difference]: Finished difference. Result has 102 places, 143 transitions, 1828 flow [2023-08-26 18:24:43,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=2532, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1828, PETRI_PLACES=102, PETRI_TRANSITIONS=143} [2023-08-26 18:24:43,923 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-08-26 18:24:43,923 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 143 transitions, 1828 flow [2023-08-26 18:24:43,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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 18:24:43,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:43,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:43,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:24:43,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:43,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2039224553, now seen corresponding path program 1 times [2023-08-26 18:24:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393556107] [2023-08-26 18:24:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:44,122 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 18:24:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393556107] [2023-08-26 18:24:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393556107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:44,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:44,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:24:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891032341] [2023-08-26 18:24:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:44,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:24:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:24:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:24:44,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 343 [2023-08-26 18:24:44,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 143 transitions, 1828 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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 18:24:44,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:44,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 343 [2023-08-26 18:24:44,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:44,723 INFO L124 PetriNetUnfolderBase]: 1229/2336 cut-off events. [2023-08-26 18:24:44,723 INFO L125 PetriNetUnfolderBase]: For 12127/12127 co-relation queries the response was YES. [2023-08-26 18:24:44,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 2336 events. 1229/2336 cut-off events. For 12127/12127 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14292 event pairs, 259 based on Foata normal form. 125/2425 useless extension candidates. Maximal degree in co-relation 10945. Up to 1639 conditions per place. [2023-08-26 18:24:44,734 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 133 selfloop transitions, 7 changer transitions 14/179 dead transitions. [2023-08-26 18:24:44,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 179 transitions, 2220 flow [2023-08-26 18:24:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:24:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:24:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-26 18:24:44,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3772594752186589 [2023-08-26 18:24:44,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-26 18:24:44,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-26 18:24:44,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:44,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-26 18:24:44,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 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 18:24:44,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 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 18:24:44,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 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 18:24:44,739 INFO L175 Difference]: Start difference. First operand has 102 places, 143 transitions, 1828 flow. Second operand 5 states and 647 transitions. [2023-08-26 18:24:44,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 179 transitions, 2220 flow [2023-08-26 18:24:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 179 transitions, 1991 flow, removed 43 selfloop flow, removed 7 redundant places. [2023-08-26 18:24:44,778 INFO L231 Difference]: Finished difference. Result has 102 places, 132 transitions, 1397 flow [2023-08-26 18:24:44,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1397, PETRI_PLACES=102, PETRI_TRANSITIONS=132} [2023-08-26 18:24:44,779 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-08-26 18:24:44,779 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 132 transitions, 1397 flow [2023-08-26 18:24:44,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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 18:24:44,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:44,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:44,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:24:44,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:44,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 737677451, now seen corresponding path program 1 times [2023-08-26 18:24:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032070023] [2023-08-26 18:24:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:44,968 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 18:24:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032070023] [2023-08-26 18:24:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032070023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:44,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:24:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470261430] [2023-08-26 18:24:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:24:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:44,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:24:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:24:44,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 343 [2023-08-26 18:24:44,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 132 transitions, 1397 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 18:24:44,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:44,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 343 [2023-08-26 18:24:44,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:45,657 INFO L124 PetriNetUnfolderBase]: 1911/3634 cut-off events. [2023-08-26 18:24:45,657 INFO L125 PetriNetUnfolderBase]: For 16493/16501 co-relation queries the response was YES. [2023-08-26 18:24:45,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 3634 events. 1911/3634 cut-off events. For 16493/16501 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24356 event pairs, 619 based on Foata normal form. 37/3622 useless extension candidates. Maximal degree in co-relation 17340. Up to 1943 conditions per place. [2023-08-26 18:24:45,675 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 166 selfloop transitions, 3 changer transitions 3/195 dead transitions. [2023-08-26 18:24:45,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 195 transitions, 2419 flow [2023-08-26 18:24:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:24:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:24:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:24:45,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071914480077745 [2023-08-26 18:24:45,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:24:45,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:24:45,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:45,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:24:45,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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 18:24:45,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:45,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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 18:24:45,679 INFO L175 Difference]: Start difference. First operand has 102 places, 132 transitions, 1397 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:24:45,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 195 transitions, 2419 flow [2023-08-26 18:24:45,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 195 transitions, 2397 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 18:24:45,756 INFO L231 Difference]: Finished difference. Result has 103 places, 131 transitions, 1387 flow [2023-08-26 18:24:45,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=103, PETRI_TRANSITIONS=131} [2023-08-26 18:24:45,757 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-08-26 18:24:45,757 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 131 transitions, 1387 flow [2023-08-26 18:24:45,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 18:24:45,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:45,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:45,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:24:45,757 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:45,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 463212068, now seen corresponding path program 1 times [2023-08-26 18:24:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584024104] [2023-08-26 18:24:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:45,989 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 18:24:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584024104] [2023-08-26 18:24:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584024104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:45,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:24:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477957742] [2023-08-26 18:24:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:45,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:24:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:24:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:24:45,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 343 [2023-08-26 18:24:45,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 131 transitions, 1387 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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 18:24:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:45,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 343 [2023-08-26 18:24:45,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:46,451 INFO L124 PetriNetUnfolderBase]: 673/1354 cut-off events. [2023-08-26 18:24:46,451 INFO L125 PetriNetUnfolderBase]: For 5470/5471 co-relation queries the response was YES. [2023-08-26 18:24:46,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6087 conditions, 1354 events. 673/1354 cut-off events. For 5470/5471 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7502 event pairs, 114 based on Foata normal form. 88/1437 useless extension candidates. Maximal degree in co-relation 6058. Up to 532 conditions per place. [2023-08-26 18:24:46,458 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 98 selfloop transitions, 12 changer transitions 23/144 dead transitions. [2023-08-26 18:24:46,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 144 transitions, 1464 flow [2023-08-26 18:24:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:24:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:24:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-08-26 18:24:46,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3744273219491878 [2023-08-26 18:24:46,460 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-08-26 18:24:46,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-08-26 18:24:46,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:46,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-08-26 18:24:46,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 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 18:24:46,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:46,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:46,465 INFO L175 Difference]: Start difference. First operand has 103 places, 131 transitions, 1387 flow. Second operand 7 states and 899 transitions. [2023-08-26 18:24:46,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 144 transitions, 1464 flow [2023-08-26 18:24:46,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 1358 flow, removed 37 selfloop flow, removed 9 redundant places. [2023-08-26 18:24:46,482 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 631 flow [2023-08-26 18:24:46,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2023-08-26 18:24:46,483 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2023-08-26 18:24:46,483 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 631 flow [2023-08-26 18:24:46,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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 18:24:46,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:46,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:24:46,484 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:46,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1322289745, now seen corresponding path program 1 times [2023-08-26 18:24:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187511000] [2023-08-26 18:24:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:46,798 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 18:24:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187511000] [2023-08-26 18:24:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187511000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:24:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067004732] [2023-08-26 18:24:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:24:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:24:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:24:46,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 343 [2023-08-26 18:24:46,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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 18:24:46,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:46,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 343 [2023-08-26 18:24:46,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:47,198 INFO L124 PetriNetUnfolderBase]: 557/1056 cut-off events. [2023-08-26 18:24:47,198 INFO L125 PetriNetUnfolderBase]: For 4037/4037 co-relation queries the response was YES. [2023-08-26 18:24:47,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 1056 events. 557/1056 cut-off events. For 4037/4037 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5507 event pairs, 103 based on Foata normal form. 22/1077 useless extension candidates. Maximal degree in co-relation 4792. Up to 472 conditions per place. [2023-08-26 18:24:47,205 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 55 selfloop transitions, 16 changer transitions 32/109 dead transitions. [2023-08-26 18:24:47,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 999 flow [2023-08-26 18:24:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:24:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:24:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1124 transitions. [2023-08-26 18:24:47,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36410754778101717 [2023-08-26 18:24:47,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1124 transitions. [2023-08-26 18:24:47,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1124 transitions. [2023-08-26 18:24:47,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:47,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1124 transitions. [2023-08-26 18:24:47,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.88888888888889) internal successors, (1124), 9 states have internal predecessors, (1124), 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 18:24:47,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 343.0) internal successors, (3430), 10 states have internal predecessors, (3430), 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 18:24:47,226 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 343.0) internal successors, (3430), 10 states have internal predecessors, (3430), 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 18:24:47,227 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 631 flow. Second operand 9 states and 1124 transitions. [2023-08-26 18:24:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 999 flow [2023-08-26 18:24:47,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 865 flow, removed 20 selfloop flow, removed 18 redundant places. [2023-08-26 18:24:47,244 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 344 flow [2023-08-26 18:24:47,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2023-08-26 18:24:47,245 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -25 predicate places. [2023-08-26 18:24:47,245 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 344 flow [2023-08-26 18:24:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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 18:24:47,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:47,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:47,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:24:47,246 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:47,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1828881551, now seen corresponding path program 1 times [2023-08-26 18:24:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732445454] [2023-08-26 18:24:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:49,232 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 18:24:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732445454] [2023-08-26 18:24:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732445454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:24:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586696312] [2023-08-26 18:24:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:49,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:24:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:24:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:24:49,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 343 [2023-08-26 18:24:49,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 344 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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 18:24:49,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:49,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 343 [2023-08-26 18:24:49,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:49,661 INFO L124 PetriNetUnfolderBase]: 807/1477 cut-off events. [2023-08-26 18:24:49,662 INFO L125 PetriNetUnfolderBase]: For 5143/5143 co-relation queries the response was YES. [2023-08-26 18:24:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6634 conditions, 1477 events. 807/1477 cut-off events. For 5143/5143 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7916 event pairs, 194 based on Foata normal form. 2/1479 useless extension candidates. Maximal degree in co-relation 6615. Up to 904 conditions per place. [2023-08-26 18:24:49,668 INFO L140 encePairwiseOnDemand]: 334/343 looper letters, 39 selfloop transitions, 14 changer transitions 56/110 dead transitions. [2023-08-26 18:24:49,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 1075 flow [2023-08-26 18:24:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:24:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:24:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2023-08-26 18:24:49,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33935860058309036 [2023-08-26 18:24:49,671 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2023-08-26 18:24:49,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2023-08-26 18:24:49,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:49,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2023-08-26 18:24:49,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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 18:24:49,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 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 18:24:49,674 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 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 18:24:49,674 INFO L175 Difference]: Start difference. First operand has 76 places, 46 transitions, 344 flow. Second operand 5 states and 582 transitions. [2023-08-26 18:24:49,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 1075 flow [2023-08-26 18:24:49,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 905 flow, removed 43 selfloop flow, removed 10 redundant places. [2023-08-26 18:24:49,693 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 376 flow [2023-08-26 18:24:49,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2023-08-26 18:24:49,694 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -35 predicate places. [2023-08-26 18:24:49,694 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 376 flow [2023-08-26 18:24:49,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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 18:24:49,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:49,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:49,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:24:49,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:49,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -255769389, now seen corresponding path program 2 times [2023-08-26 18:24:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:49,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107299084] [2023-08-26 18:24:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:24:51,020 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 18:24:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:24:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107299084] [2023-08-26 18:24:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107299084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:24:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:24:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:24:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776549251] [2023-08-26 18:24:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:24:51,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:24:51,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:24:51,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:24:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:24:51,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 343 [2023-08-26 18:24:51,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 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 18:24:51,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:24:51,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 343 [2023-08-26 18:24:51,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:24:51,371 INFO L124 PetriNetUnfolderBase]: 264/575 cut-off events. [2023-08-26 18:24:51,371 INFO L125 PetriNetUnfolderBase]: For 1848/1854 co-relation queries the response was YES. [2023-08-26 18:24:51,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 575 events. 264/575 cut-off events. For 1848/1854 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2977 event pairs, 60 based on Foata normal form. 6/581 useless extension candidates. Maximal degree in co-relation 2595. Up to 241 conditions per place. [2023-08-26 18:24:51,373 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 35 selfloop transitions, 8 changer transitions 63/107 dead transitions. [2023-08-26 18:24:51,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 992 flow [2023-08-26 18:24:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:24:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:24:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 707 transitions. [2023-08-26 18:24:51,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2944606413994169 [2023-08-26 18:24:51,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 707 transitions. [2023-08-26 18:24:51,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 707 transitions. [2023-08-26 18:24:51,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:24:51,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 707 transitions. [2023-08-26 18:24:51,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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 18:24:51,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:51,379 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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 18:24:51,379 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 376 flow. Second operand 7 states and 707 transitions. [2023-08-26 18:24:51,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 992 flow [2023-08-26 18:24:51,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 903 flow, removed 38 selfloop flow, removed 9 redundant places. [2023-08-26 18:24:51,384 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 307 flow [2023-08-26 18:24:51,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-08-26 18:24:51,385 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -38 predicate places. [2023-08-26 18:24:51,385 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 307 flow [2023-08-26 18:24:51,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 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 18:24:51,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:24:51,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:51,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:24:51,386 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 18:24:51,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:24:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2042097863, now seen corresponding path program 3 times [2023-08-26 18:24:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:24:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893333420] [2023-08-26 18:24:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:24:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:24:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:24:51,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:24:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:24:51,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:24:51,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:24:51,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (107 of 108 remaining) [2023-08-26 18:24:51,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 108 remaining) [2023-08-26 18:24:51,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 108 remaining) [2023-08-26 18:24:51,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 108 remaining) [2023-08-26 18:24:51,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 108 remaining) [2023-08-26 18:24:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 108 remaining) [2023-08-26 18:24:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 108 remaining) [2023-08-26 18:24:51,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 108 remaining) [2023-08-26 18:24:51,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 108 remaining) [2023-08-26 18:24:51,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 108 remaining) [2023-08-26 18:24:51,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 108 remaining) [2023-08-26 18:24:51,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 108 remaining) [2023-08-26 18:24:51,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 108 remaining) [2023-08-26 18:24:51,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 108 remaining) [2023-08-26 18:24:51,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 108 remaining) [2023-08-26 18:24:51,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 108 remaining) [2023-08-26 18:24:51,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:24:51,666 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:24:51,672 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:24:51,672 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:24:51,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:24:51 BasicIcfg [2023-08-26 18:24:51,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:24:51,778 INFO L158 Benchmark]: Toolchain (without parser) took 65773.97ms. Allocated memory was 346.0MB in the beginning and 5.2GB in the end (delta: 4.8GB). Free memory was 321.0MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-26 18:24:51,779 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 346.0MB. Free memory is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:24:51,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.80ms. Allocated memory is still 346.0MB. Free memory was 320.5MB in the beginning and 294.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:24:51,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 346.0MB. Free memory was 294.2MB in the beginning and 291.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 18:24:51,779 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 346.0MB. Free memory was 291.1MB in the beginning and 288.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:24:51,780 INFO L158 Benchmark]: RCFGBuilder took 1694.69ms. Allocated memory was 346.0MB in the beginning and 478.2MB in the end (delta: 132.1MB). Free memory was 288.4MB in the beginning and 358.8MB in the end (delta: -70.3MB). Peak memory consumption was 73.9MB. Max. memory is 16.0GB. [2023-08-26 18:24:51,780 INFO L158 Benchmark]: TraceAbstraction took 63472.04ms. Allocated memory was 478.2MB in the beginning and 5.2GB in the end (delta: 4.7GB). Free memory was 357.7MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-08-26 18:24:51,781 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.14ms. Allocated memory is still 346.0MB. Free memory is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 508.80ms. Allocated memory is still 346.0MB. Free memory was 320.5MB in the beginning and 294.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 346.0MB. Free memory was 294.2MB in the beginning and 291.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 346.0MB. Free memory was 291.1MB in the beginning and 288.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1694.69ms. Allocated memory was 346.0MB in the beginning and 478.2MB in the end (delta: 132.1MB). Free memory was 288.4MB in the beginning and 358.8MB in the end (delta: -70.3MB). Peak memory consumption was 73.9MB. Max. memory is 16.0GB. * TraceAbstraction took 63472.04ms. Allocated memory was 478.2MB in the beginning and 5.2GB in the end (delta: 4.7GB). Free memory was 357.7MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. 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: 22.9s, 196 PlacesBefore, 101 PlacesAfterwards, 189 TransitionsBefore, 92 TransitionsAfterwards, 9360 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 151 TotalNumberOfCompositions, 68301 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8738, independent: 7735, independent conditional: 0, independent unconditional: 7735, dependent: 1003, dependent conditional: 0, dependent unconditional: 1003, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3092, independent: 3004, independent conditional: 0, independent unconditional: 3004, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8738, independent: 4731, independent conditional: 0, independent unconditional: 4731, dependent: 915, dependent conditional: 0, dependent unconditional: 915, unknown: 3092, unknown conditional: 0, unknown unconditional: 3092] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 316, Positive conditional cache size: 0, Positive unconditional cache size: 316, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, 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; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2124, ((void *)0), P0, ((void *)0))=-1, t2124={8: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 t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2125, ((void *)0), P1, ((void *)0))=0, t2124={8:0}, t2125={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] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2126, ((void *)0), P2, ((void *)0))=1, t2124={8:0}, t2125={6:0}, t2126={9: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] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] EXPR 3 \read(x) [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, 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] [L828] 3 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, 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=1] [L759] 1 y = 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, 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=2] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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 [__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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, 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=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 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, 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=1, weak$$choice2=255, 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=2] [L789] 2 x = 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, 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=1, weak$$choice2=255, 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=2] [L792] 2 x = 2 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, 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=1, weak$$choice2=255, 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=2] [L795] 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) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] 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) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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 [__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, 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=1, weak$$choice2=255, 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=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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, 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, t2124={8:0}, t2125={6:0}, t2126={9:0}, weak$$choice1=1, weak$$choice2=255, 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=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(x) [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 \read(x) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 \read(x) [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] EXPR 0 \read(x) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] 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", "safe015_power.opt.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=2, 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=0, x$flush_delayed=0, x$mem_tmp=2, 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=2] - 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: -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: 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: 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: 858]: 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, 256 locations, 108 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: 63.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2262 IncrementalHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 10 mSDtfsCounter, 2262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2807occurred in iteration=12, InterpolantAutomatonStates: 104, 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.8s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 3107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 18:24:51,812 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...