/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/mix037_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:15:23,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:15:23,879 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:15:23,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:15:23,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:15:23,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:15:23,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:15:23,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:15:23,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:15:23,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:15:23,905 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:15:23,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:15:23,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:15:23,906 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:15:23,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:15:23,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:15:23,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:15:23,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:15:23,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:15:23,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:15:23,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:15:23,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:15:23,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:15:23,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:15:23,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:15:23,910 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:15:23,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:15:23,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:23,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:15:23,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:15:23,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:15:23,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:15:23,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:15:23,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:15:23,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:15:23,913 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:15:24,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:15:24,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:15:24,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:15:24,236 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:15:24,237 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:15:24,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:15:25,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:15:25,698 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:15:25,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:15:25,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc47f989e/a92490dd537c4b338e2883d8e9e79b69/FLAGbb49b0925 [2023-08-26 18:15:25,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc47f989e/a92490dd537c4b338e2883d8e9e79b69 [2023-08-26 18:15:25,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:15:25,741 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:15:25,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:25,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:15:25,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:15:25,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:25" (1/1) ... [2023-08-26 18:15:25,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aa8f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:25, skipping insertion in model container [2023-08-26 18:15:25,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:25" (1/1) ... [2023-08-26 18:15:25,795 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:15:26,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:26,159 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:15:26,189 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:26,191 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:26,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:26,294 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:26,294 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:26,300 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:15:26,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26 WrapperNode [2023-08-26 18:15:26,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:26,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:26,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:15:26,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:15:26,308 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:15:26" (1/1) ... [2023-08-26 18:15:26,334 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:15:26" (1/1) ... [2023-08-26 18:15:26,372 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-26 18:15:26,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:26,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:15:26,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:15:26,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:15:26,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:15:26,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:15:26,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:15:26,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:15:26,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (1/1) ... [2023-08-26 18:15:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:15:26,458 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:15:26,468 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:15:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:15:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:15:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:15:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:15:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:15:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:15:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:15:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:15:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:15:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:15:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:15:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:15:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:15:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:15:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:15:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:15:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:15:26,496 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:15:26,650 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:15:26,652 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:15:27,042 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:15:27,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:15:27,129 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:15:27,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:27 BoogieIcfgContainer [2023-08-26 18:15:27,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:15:27,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:15:27,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:15:27,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:15:27,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:15:25" (1/3) ... [2023-08-26 18:15:27,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5169e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:27, skipping insertion in model container [2023-08-26 18:15:27,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:26" (2/3) ... [2023-08-26 18:15:27,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5169e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:27, skipping insertion in model container [2023-08-26 18:15:27,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:27" (3/3) ... [2023-08-26 18:15:27,138 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:15:27,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:15:27,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:15:27,153 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:15:27,202 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:15:27,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 18:15:27,280 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 18:15:27,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:27,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 18:15:27,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 18:15:27,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-26 18:15:27,292 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:15:27,304 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 18:15:27,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 18:15:27,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-26 18:15:27,338 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 18:15:27,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:27,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 18:15:27,341 INFO L119 LiptonReduction]: Number of co-enabled transitions 3698 [2023-08-26 18:15:32,351 INFO L134 LiptonReduction]: Checked pairs total: 11438 [2023-08-26 18:15:32,351 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-26 18:15:32,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:15:32,369 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;@1e1f75b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:15:32,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:15:32,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:15:32,370 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:15:32,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:32,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:32,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:15:32,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:32,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2023-08-26 18:15:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55118054] [2023-08-26 18:15:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:32,491 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:15:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55118054] [2023-08-26 18:15:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55118054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:15:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317580735] [2023-08-26 18:15:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:32,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:15:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:15:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:15:32,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 281 [2023-08-26 18:15:32,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:15:32,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:32,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 281 [2023-08-26 18:15:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:33,856 INFO L124 PetriNetUnfolderBase]: 7479/10129 cut-off events. [2023-08-26 18:15:33,856 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-26 18:15:33,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20437 conditions, 10129 events. 7479/10129 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 50760 event pairs, 7479 based on Foata normal form. 0/9105 useless extension candidates. Maximal degree in co-relation 20425. Up to 10091 conditions per place. [2023-08-26 18:15:33,932 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 18:15:33,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2023-08-26 18:15:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:15:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:15:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2023-08-26 18:15:33,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-08-26 18:15:33,949 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 294 transitions. [2023-08-26 18:15:33,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions. [2023-08-26 18:15:33,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:33,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions. [2023-08-26 18:15:33,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:15:33,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have 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:15:33,963 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have 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:15:33,965 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 294 transitions. [2023-08-26 18:15:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2023-08-26 18:15:33,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:33,972 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 18:15:33,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 18:15:33,976 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 18:15:33,977 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 18:15:33,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:15:33,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:33,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:15:33,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:15:33,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:33,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash 618378, now seen corresponding path program 1 times [2023-08-26 18:15:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850697529] [2023-08-26 18:15:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:34,237 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:15:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850697529] [2023-08-26 18:15:34,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850697529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:34,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:34,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874895879] [2023-08-26 18:15:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:34,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:34,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-08-26 18:15:34,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:15:34,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:34,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-08-26 18:15:34,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:35,056 INFO L124 PetriNetUnfolderBase]: 5879/8110 cut-off events. [2023-08-26 18:15:35,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:35,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8110 events. 5879/8110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40856 event pairs, 2239 based on Foata normal form. 0/7722 useless extension candidates. Maximal degree in co-relation 16248. Up to 6367 conditions per place. [2023-08-26 18:15:35,106 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-26 18:15:35,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 208 flow [2023-08-26 18:15:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-26 18:15:35,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-08-26 18:15:35,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-26 18:15:35,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-26 18:15:35,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:35,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-26 18:15:35,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have 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:15:35,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 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:15:35,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 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:15:35,113 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 432 transitions. [2023-08-26 18:15:35,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 208 flow [2023-08-26 18:15:35,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:15:35,114 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 18:15:35,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 18:15:35,115 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 18:15:35,115 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 18:15:35,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:15:35,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:35,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:35,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:15:35,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:35,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -64135266, now seen corresponding path program 1 times [2023-08-26 18:15:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974697888] [2023-08-26 18:15:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:35,357 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:15:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974697888] [2023-08-26 18:15:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974697888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:35,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:35,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080396035] [2023-08-26 18:15:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:35,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:35,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:35,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 18:15:35,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:15:35,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:35,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 18:15:35,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:37,122 INFO L124 PetriNetUnfolderBase]: 14433/19638 cut-off events. [2023-08-26 18:15:37,123 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2023-08-26 18:15:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40413 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 101981 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40409. Up to 13647 conditions per place. [2023-08-26 18:15:37,253 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-26 18:15:37,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 222 flow [2023-08-26 18:15:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-26 18:15:37,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816132858837485 [2023-08-26 18:15:37,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-26 18:15:37,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-26 18:15:37,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:37,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-26 18:15:37,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:15:37,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 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:15:37,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 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:15:37,259 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 406 transitions. [2023-08-26 18:15:37,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 222 flow [2023-08-26 18:15:37,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:37,261 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 118 flow [2023-08-26 18:15:37,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-08-26 18:15:37,262 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-26 18:15:37,262 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 118 flow [2023-08-26 18:15:37,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:15:37,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:37,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:37,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:15:37,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:37,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1988195922, now seen corresponding path program 1 times [2023-08-26 18:15:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428901169] [2023-08-26 18:15:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:37,405 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:15:37,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428901169] [2023-08-26 18:15:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428901169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:37,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:15:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976525823] [2023-08-26 18:15:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:37,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 18:15:37,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have 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:15:37,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:37,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 18:15:37,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:38,817 INFO L124 PetriNetUnfolderBase]: 13351/18188 cut-off events. [2023-08-26 18:15:38,817 INFO L125 PetriNetUnfolderBase]: For 6679/6679 co-relation queries the response was YES. [2023-08-26 18:15:38,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44458 conditions, 18188 events. 13351/18188 cut-off events. For 6679/6679 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 90069 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44453. Up to 9003 conditions per place. [2023-08-26 18:15:38,945 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-26 18:15:38,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 320 flow [2023-08-26 18:15:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 18:15:38,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47153024911032027 [2023-08-26 18:15:38,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 18:15:38,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 18:15:38,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:38,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 18:15:38,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have 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:15:38,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:38,952 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:38,952 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 118 flow. Second operand 4 states and 530 transitions. [2023-08-26 18:15:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 320 flow [2023-08-26 18:15:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:38,988 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 162 flow [2023-08-26 18:15:38,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 18:15:38,989 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 18:15:38,990 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 162 flow [2023-08-26 18:15:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have 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:15:38,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:38,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:38,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:15:38,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:38,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1585081352, now seen corresponding path program 1 times [2023-08-26 18:15:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006935113] [2023-08-26 18:15:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006935113] [2023-08-26 18:15:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006935113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:15:39,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819734186] [2023-08-26 18:15:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:39,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:39,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:39,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 18:15:39,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have 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:15:39,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:39,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 18:15:39,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:40,702 INFO L124 PetriNetUnfolderBase]: 13076/17813 cut-off events. [2023-08-26 18:15:40,702 INFO L125 PetriNetUnfolderBase]: For 11335/11335 co-relation queries the response was YES. [2023-08-26 18:15:40,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46099 conditions, 17813 events. 13076/17813 cut-off events. For 11335/11335 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 91421 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46092. Up to 11817 conditions per place. [2023-08-26 18:15:40,798 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-08-26 18:15:40,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 444 flow [2023-08-26 18:15:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-26 18:15:40,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822064056939502 [2023-08-26 18:15:40,800 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-26 18:15:40,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-26 18:15:40,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:40,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-26 18:15:40,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:40,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:40,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:40,805 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 162 flow. Second operand 4 states and 542 transitions. [2023-08-26 18:15:40,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 444 flow [2023-08-26 18:15:40,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:15:40,822 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 255 flow [2023-08-26 18:15:40,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:15:40,825 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 18:15:40,825 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 255 flow [2023-08-26 18:15:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have 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:15:40,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:40,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:15:40,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:40,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1892911302, now seen corresponding path program 1 times [2023-08-26 18:15:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843198891] [2023-08-26 18:15:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:40,990 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:15:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843198891] [2023-08-26 18:15:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843198891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:40,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:40,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272598378] [2023-08-26 18:15:40,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:40,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:40,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:40,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:15:40,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:15:40,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:40,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:15:40,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:42,008 INFO L124 PetriNetUnfolderBase]: 8956/13012 cut-off events. [2023-08-26 18:15:42,008 INFO L125 PetriNetUnfolderBase]: For 11080/11668 co-relation queries the response was YES. [2023-08-26 18:15:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34643 conditions, 13012 events. 8956/13012 cut-off events. For 11080/11668 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 77466 event pairs, 1593 based on Foata normal form. 1185/13852 useless extension candidates. Maximal degree in co-relation 34633. Up to 7998 conditions per place. [2023-08-26 18:15:42,077 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 88 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2023-08-26 18:15:42,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 750 flow [2023-08-26 18:15:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:15:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:15:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 18:15:42,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47758007117437723 [2023-08-26 18:15:42,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 18:15:42,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 18:15:42,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:42,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 18:15:42,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have 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:15:42,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:15:42,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:15:42,092 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 255 flow. Second operand 5 states and 671 transitions. [2023-08-26 18:15:42,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 750 flow [2023-08-26 18:15:42,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:15:42,110 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 330 flow [2023-08-26 18:15:42,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-26 18:15:42,113 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-26 18:15:42,116 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 330 flow [2023-08-26 18:15:42,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:15:42,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:42,117 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:15:42,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:15:42,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:42,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 311587015, now seen corresponding path program 1 times [2023-08-26 18:15:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333967088] [2023-08-26 18:15:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:42,320 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:15:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333967088] [2023-08-26 18:15:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333967088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:42,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395525194] [2023-08-26 18:15:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:42,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:42,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:42,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:42,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 18:15:42,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have 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:15:42,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:42,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 18:15:42,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:43,688 INFO L124 PetriNetUnfolderBase]: 14456/20536 cut-off events. [2023-08-26 18:15:43,688 INFO L125 PetriNetUnfolderBase]: For 31218/31218 co-relation queries the response was YES. [2023-08-26 18:15:43,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70114 conditions, 20536 events. 14456/20536 cut-off events. For 31218/31218 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 117140 event pairs, 4456 based on Foata normal form. 204/20740 useless extension candidates. Maximal degree in co-relation 70100. Up to 11398 conditions per place. [2023-08-26 18:15:43,790 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 67 selfloop transitions, 11 changer transitions 14/92 dead transitions. [2023-08-26 18:15:43,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 671 flow [2023-08-26 18:15:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-26 18:15:43,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47686832740213525 [2023-08-26 18:15:43,793 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-26 18:15:43,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-26 18:15:43,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:43,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-26 18:15:43,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have 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:15:43,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:43,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:43,802 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 330 flow. Second operand 4 states and 536 transitions. [2023-08-26 18:15:43,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 671 flow [2023-08-26 18:15:43,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:15:43,944 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 308 flow [2023-08-26 18:15:43,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-26 18:15:43,944 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-26 18:15:43,945 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 308 flow [2023-08-26 18:15:43,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have 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:15:43,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:43,945 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:15:43,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:15:43,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:43,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -895739608, now seen corresponding path program 1 times [2023-08-26 18:15:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139848975] [2023-08-26 18:15:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:44,178 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:15:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139848975] [2023-08-26 18:15:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139848975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898071503] [2023-08-26 18:15:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:44,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:44,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:15:44,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have 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:15:44,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:44,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:15:44,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:45,051 INFO L124 PetriNetUnfolderBase]: 5147/7949 cut-off events. [2023-08-26 18:15:45,051 INFO L125 PetriNetUnfolderBase]: For 10051/10160 co-relation queries the response was YES. [2023-08-26 18:15:45,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25839 conditions, 7949 events. 5147/7949 cut-off events. For 10051/10160 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47984 event pairs, 897 based on Foata normal form. 777/8554 useless extension candidates. Maximal degree in co-relation 25824. Up to 2806 conditions per place. [2023-08-26 18:15:45,087 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 104 selfloop transitions, 14 changer transitions 1/129 dead transitions. [2023-08-26 18:15:45,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 1004 flow [2023-08-26 18:15:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-26 18:15:45,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4792408066429419 [2023-08-26 18:15:45,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-26 18:15:45,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-26 18:15:45,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:45,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-26 18:15:45,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:15:45,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:15:45,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:15:45,097 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 308 flow. Second operand 6 states and 808 transitions. [2023-08-26 18:15:45,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 1004 flow [2023-08-26 18:15:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 925 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:45,151 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 387 flow [2023-08-26 18:15:45,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-26 18:15:45,152 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-26 18:15:45,152 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 387 flow [2023-08-26 18:15:45,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have 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:15:45,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:45,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:45,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:15:45,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:45,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1072722958, now seen corresponding path program 1 times [2023-08-26 18:15:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:45,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065233566] [2023-08-26 18:15:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:45,408 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:15:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065233566] [2023-08-26 18:15:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065233566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231386983] [2023-08-26 18:15:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:45,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:15:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:45,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:15:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:15:45,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:15:45,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have 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:15:45,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:45,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:15:45,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:46,289 INFO L124 PetriNetUnfolderBase]: 4561/7077 cut-off events. [2023-08-26 18:15:46,290 INFO L125 PetriNetUnfolderBase]: For 10670/10737 co-relation queries the response was YES. [2023-08-26 18:15:46,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26390 conditions, 7077 events. 4561/7077 cut-off events. For 10670/10737 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 42607 event pairs, 750 based on Foata normal form. 301/7217 useless extension candidates. Maximal degree in co-relation 26373. Up to 2593 conditions per place. [2023-08-26 18:15:46,324 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 116 selfloop transitions, 22 changer transitions 16/164 dead transitions. [2023-08-26 18:15:46,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 164 transitions, 1269 flow [2023-08-26 18:15:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:15:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:15:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1077 transitions. [2023-08-26 18:15:46,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790925266903915 [2023-08-26 18:15:46,328 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1077 transitions. [2023-08-26 18:15:46,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1077 transitions. [2023-08-26 18:15:46,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:46,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1077 transitions. [2023-08-26 18:15:46,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.625) internal successors, (1077), 8 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have 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:15:46,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have 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:15:46,335 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have 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:15:46,335 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 387 flow. Second operand 8 states and 1077 transitions. [2023-08-26 18:15:46,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 164 transitions, 1269 flow [2023-08-26 18:15:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 1218 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:46,693 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 494 flow [2023-08-26 18:15:46,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=494, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-26 18:15:46,694 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 18:15:46,694 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 494 flow [2023-08-26 18:15:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have 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:15:46,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:46,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, 1, 1] [2023-08-26 18:15:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:15:46,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:46,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1393516849, now seen corresponding path program 1 times [2023-08-26 18:15:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640333] [2023-08-26 18:15:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:47,585 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:15:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056640333] [2023-08-26 18:15:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056640333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575869420] [2023-08-26 18:15:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:47,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:15:47,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 494 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have 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:15:47,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:47,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:15:47,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:48,810 INFO L124 PetriNetUnfolderBase]: 7233/11624 cut-off events. [2023-08-26 18:15:48,811 INFO L125 PetriNetUnfolderBase]: For 31648/31694 co-relation queries the response was YES. [2023-08-26 18:15:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47536 conditions, 11624 events. 7233/11624 cut-off events. For 31648/31694 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 80518 event pairs, 974 based on Foata normal form. 41/11494 useless extension candidates. Maximal degree in co-relation 47516. Up to 3881 conditions per place. [2023-08-26 18:15:48,862 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 128 selfloop transitions, 7 changer transitions 68/213 dead transitions. [2023-08-26 18:15:48,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 213 transitions, 2143 flow [2023-08-26 18:15:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-26 18:15:48,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687341128622267 [2023-08-26 18:15:48,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-26 18:15:48,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-26 18:15:48,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:48,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-26 18:15:48,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have 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:15:48,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:15:48,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:15:48,871 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 494 flow. Second operand 7 states and 922 transitions. [2023-08-26 18:15:48,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 213 transitions, 2143 flow [2023-08-26 18:15:49,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 1782 flow, removed 137 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:49,926 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 480 flow [2023-08-26 18:15:49,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=480, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-08-26 18:15:49,927 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-26 18:15:49,927 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 480 flow [2023-08-26 18:15:49,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have 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:15:49,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:49,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:15:49,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:49,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1476868067, now seen corresponding path program 2 times [2023-08-26 18:15:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824787931] [2023-08-26 18:15:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:50,151 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:15:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824787931] [2023-08-26 18:15:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824787931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:15:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266742491] [2023-08-26 18:15:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:50,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:50,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:15:50,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 480 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have 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:15:50,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:50,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:15:50,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:51,088 INFO L124 PetriNetUnfolderBase]: 5668/9069 cut-off events. [2023-08-26 18:15:51,088 INFO L125 PetriNetUnfolderBase]: For 16540/16672 co-relation queries the response was YES. [2023-08-26 18:15:51,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34882 conditions, 9069 events. 5668/9069 cut-off events. For 16540/16672 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 60231 event pairs, 718 based on Foata normal form. 156/9066 useless extension candidates. Maximal degree in co-relation 34858. Up to 2094 conditions per place. [2023-08-26 18:15:51,142 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 119 selfloop transitions, 27 changer transitions 28/182 dead transitions. [2023-08-26 18:15:51,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 182 transitions, 1459 flow [2023-08-26 18:15:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:15:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:15:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1315 transitions. [2023-08-26 18:15:51,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4679715302491103 [2023-08-26 18:15:51,146 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1315 transitions. [2023-08-26 18:15:51,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1315 transitions. [2023-08-26 18:15:51,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:51,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1315 transitions. [2023-08-26 18:15:51,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.5) internal successors, (1315), 10 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have 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:15:51,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have 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:15:51,154 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have 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:15:51,154 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 480 flow. Second operand 10 states and 1315 transitions. [2023-08-26 18:15:51,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 182 transitions, 1459 flow [2023-08-26 18:15:51,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 182 transitions, 1424 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:51,755 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 499 flow [2023-08-26 18:15:51,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2023-08-26 18:15:51,755 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-26 18:15:51,755 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 499 flow [2023-08-26 18:15:51,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have 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:15:51,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:51,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:15:51,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:51,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1134187064, now seen corresponding path program 1 times [2023-08-26 18:15:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168527056] [2023-08-26 18:15:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:51,960 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:15:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168527056] [2023-08-26 18:15:51,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168527056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:51,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:51,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525868525] [2023-08-26 18:15:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:51,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:51,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-26 18:15:51,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have 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:15:51,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:51,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-26 18:15:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:52,702 INFO L124 PetriNetUnfolderBase]: 4592/7225 cut-off events. [2023-08-26 18:15:52,703 INFO L125 PetriNetUnfolderBase]: For 19923/20070 co-relation queries the response was YES. [2023-08-26 18:15:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31819 conditions, 7225 events. 4592/7225 cut-off events. For 19923/20070 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 44400 event pairs, 1132 based on Foata normal form. 121/7268 useless extension candidates. Maximal degree in co-relation 31794. Up to 3374 conditions per place. [2023-08-26 18:15:52,734 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 75 selfloop transitions, 1 changer transitions 58/138 dead transitions. [2023-08-26 18:15:52,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 138 transitions, 1370 flow [2023-08-26 18:15:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-26 18:15:52,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875444839857651 [2023-08-26 18:15:52,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-26 18:15:52,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-26 18:15:52,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:52,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-26 18:15:52,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have 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:15:52,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:52,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:52,740 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 499 flow. Second operand 4 states and 548 transitions. [2023-08-26 18:15:52,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 138 transitions, 1370 flow [2023-08-26 18:15:52,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 1093 flow, removed 55 selfloop flow, removed 14 redundant places. [2023-08-26 18:15:52,943 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 362 flow [2023-08-26 18:15:52,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-08-26 18:15:52,944 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 18:15:52,944 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 362 flow [2023-08-26 18:15:52,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have 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:15:52,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:52,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:15:52,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:52,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -914472652, now seen corresponding path program 2 times [2023-08-26 18:15:52,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:52,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032915865] [2023-08-26 18:15:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:53,133 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:15:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032915865] [2023-08-26 18:15:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032915865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140935131] [2023-08-26 18:15:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:53,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:53,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-26 18:15:53,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have 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:15:53,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:53,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-26 18:15:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:53,657 INFO L124 PetriNetUnfolderBase]: 3815/6060 cut-off events. [2023-08-26 18:15:53,657 INFO L125 PetriNetUnfolderBase]: For 11505/11578 co-relation queries the response was YES. [2023-08-26 18:15:53,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22163 conditions, 6060 events. 3815/6060 cut-off events. For 11505/11578 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 35799 event pairs, 737 based on Foata normal form. 54/6104 useless extension candidates. Maximal degree in co-relation 22143. Up to 3211 conditions per place. [2023-08-26 18:15:53,689 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 47 selfloop transitions, 1 changer transitions 78/128 dead transitions. [2023-08-26 18:15:53,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 990 flow [2023-08-26 18:15:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-26 18:15:53,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919928825622776 [2023-08-26 18:15:53,691 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-26 18:15:53,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-26 18:15:53,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:53,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-26 18:15:53,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:15:53,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:53,694 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:15:53,694 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 362 flow. Second operand 4 states and 553 transitions. [2023-08-26 18:15:53,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 990 flow [2023-08-26 18:15:53,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 128 transitions, 985 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:53,812 INFO L231 Difference]: Finished difference. Result has 76 places, 42 transitions, 221 flow [2023-08-26 18:15:53,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=76, PETRI_TRANSITIONS=42} [2023-08-26 18:15:53,814 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-26 18:15:53,814 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 42 transitions, 221 flow [2023-08-26 18:15:53,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have 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:15:53,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:53,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:53,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:15:53,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:53,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1709377104, now seen corresponding path program 3 times [2023-08-26 18:15:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:53,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803642534] [2023-08-26 18:15:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:54,748 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:15:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803642534] [2023-08-26 18:15:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803642534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:15:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170032691] [2023-08-26 18:15:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:54,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:15:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:15:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:15:54,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 281 [2023-08-26 18:15:54,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 42 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have 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:15:54,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:54,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 281 [2023-08-26 18:15:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:55,154 INFO L124 PetriNetUnfolderBase]: 1003/1621 cut-off events. [2023-08-26 18:15:55,155 INFO L125 PetriNetUnfolderBase]: For 2240/2240 co-relation queries the response was YES. [2023-08-26 18:15:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5664 conditions, 1621 events. 1003/1621 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6952 event pairs, 237 based on Foata normal form. 1/1622 useless extension candidates. Maximal degree in co-relation 5643. Up to 678 conditions per place. [2023-08-26 18:15:55,163 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 54 selfloop transitions, 4 changer transitions 69/127 dead transitions. [2023-08-26 18:15:55,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 892 flow [2023-08-26 18:15:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:15:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:15:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 959 transitions. [2023-08-26 18:15:55,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266014234875445 [2023-08-26 18:15:55,166 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 959 transitions. [2023-08-26 18:15:55,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 959 transitions. [2023-08-26 18:15:55,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:55,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 959 transitions. [2023-08-26 18:15:55,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have 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:15:55,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have 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:15:55,172 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have 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:15:55,172 INFO L175 Difference]: Start difference. First operand has 76 places, 42 transitions, 221 flow. Second operand 8 states and 959 transitions. [2023-08-26 18:15:55,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 892 flow [2023-08-26 18:15:55,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 127 transitions, 840 flow, removed 13 selfloop flow, removed 13 redundant places. [2023-08-26 18:15:55,185 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 214 flow [2023-08-26 18:15:55,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2023-08-26 18:15:55,186 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-26 18:15:55,186 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 214 flow [2023-08-26 18:15:55,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have 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:15:55,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:55,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:55,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:15:55,187 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:55,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1638805578, now seen corresponding path program 4 times [2023-08-26 18:15:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936359769] [2023-08-26 18:15:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:55,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:15:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:55,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:15:55,345 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:15:55,345 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:15:55,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:15:55,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:15:55,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:15:55,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:15:55,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:15:55,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:15:55,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:15:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:15:55,349 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:55,354 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:15:55,355 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:15:55,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:15:55 BasicIcfg [2023-08-26 18:15:55,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:15:55,472 INFO L158 Benchmark]: Toolchain (without parser) took 29731.17ms. Allocated memory was 358.6MB in the beginning and 3.4GB in the end (delta: 3.0GB). Free memory was 334.0MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 18:15:55,472 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 358.6MB. Free memory is still 335.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:15:55,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.70ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 309.4MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:55,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.12ms. Allocated memory is still 358.6MB. Free memory was 309.4MB in the beginning and 306.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:55,473 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 358.6MB. Free memory was 306.8MB in the beginning and 304.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:55,473 INFO L158 Benchmark]: RCFGBuilder took 704.08ms. Allocated memory is still 358.6MB. Free memory was 304.7MB in the beginning and 311.0MB in the end (delta: -6.3MB). Peak memory consumption was 25.0MB. Max. memory is 16.0GB. [2023-08-26 18:15:55,473 INFO L158 Benchmark]: TraceAbstraction took 28338.63ms. Allocated memory was 358.6MB in the beginning and 3.4GB in the end (delta: 3.0GB). Free memory was 309.9MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 18:15:55,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 358.6MB. Free memory is still 335.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 558.70ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 309.4MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.12ms. Allocated memory is still 358.6MB. Free memory was 309.4MB in the beginning and 306.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 358.6MB. Free memory was 306.8MB in the beginning and 304.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 704.08ms. Allocated memory is still 358.6MB. Free memory was 304.7MB in the beginning and 311.0MB in the end (delta: -6.3MB). Peak memory consumption was 25.0MB. Max. memory is 16.0GB. * TraceAbstraction took 28338.63ms. Allocated memory was 358.6MB in the beginning and 3.4GB in the end (delta: 3.0GB). Free memory was 309.9MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 151 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 3698 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 11438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4914, independent: 4630, independent conditional: 0, independent unconditional: 4630, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2062, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4914, independent: 2625, independent conditional: 0, independent unconditional: 2625, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 2062, unknown conditional: 0, unknown unconditional: 2062] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-3, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-2, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix037_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 872]: 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: 876]: 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: 874]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 597 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1672 IncrementalHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 23 mSDtfsCounter, 1672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=499occurred in iteration=11, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:15:55,496 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...