/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.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:09:59,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:09:59,648 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-27 10:09:59,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:09:59,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:09:59,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:09:59,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:09:59,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:09:59,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:09:59,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:09:59,677 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:09:59,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:09:59,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:09:59,678 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:09:59,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:09:59,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:09:59,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:09:59,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:09:59,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:09:59,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:09:59,685 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:09:59,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:09:59,686 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:09:59,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:09:59,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:09:59,687 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:09:59,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:09:59,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:09:59,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:09:59,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:09:59,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:09:59,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:09:59,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:09:59,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:09:59,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:09:59,689 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: Check absence of signed integer overflows -> true [2023-08-27 10:09:59,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:09:59,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:09:59,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:09:59,982 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:09:59,982 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:09:59,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-27 10:10:01,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:10:01,470 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:10:01,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-27 10:10:01,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795a45060/b041750bd6f348f4a6ae2aac3ce674a0/FLAGe7b22ff6f [2023-08-27 10:10:01,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795a45060/b041750bd6f348f4a6ae2aac3ce674a0 [2023-08-27 10:10:01,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:10:01,507 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:10:01,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:10:01,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:10:01,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:10:01,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:10:01" (1/1) ... [2023-08-27 10:10:01,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31427caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:01, skipping insertion in model container [2023-08-27 10:10:01,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:10:01" (1/1) ... [2023-08-27 10:10:01,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:10:01,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:10:01,971 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:10:01,999 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:10:02,000 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:10:02,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:10:02,094 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:10:02,094 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:10:02,100 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:10:02,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02 WrapperNode [2023-08-27 10:10:02,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:10:02,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:10:02,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:10:02,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:10:02,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,169 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-27 10:10:02,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:10:02,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:10:02,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:10:02,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:10:02,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:10:02,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:10:02,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:10:02,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:10:02,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (1/1) ... [2023-08-27 10:10:02,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:10:02,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:10:02,266 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-27 10:10:02,280 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-27 10:10:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:10:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:10:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:10:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:10:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:10:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:10:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:10:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:10:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:10:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:10:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:10:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:10:02,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:10:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:10:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:10:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:10:02,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:10:02,310 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:10:02,473 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:10:02,475 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:10:02,795 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:10:02,906 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:10:02,906 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:10:02,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:10:02 BoogieIcfgContainer [2023-08-27 10:10:02,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:10:02,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:10:02,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:10:02,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:10:02,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:10:01" (1/3) ... [2023-08-27 10:10:02,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348a8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:10:02, skipping insertion in model container [2023-08-27 10:10:02,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:02" (2/3) ... [2023-08-27 10:10:02,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348a8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:10:02, skipping insertion in model container [2023-08-27 10:10:02,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:10:02" (3/3) ... [2023-08-27 10:10:02,914 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-27 10:10:02,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:10:02,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:10:02,928 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:10:02,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:10:03,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 10:10:03,083 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 10:10:03,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:03,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:10:03,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 10:10:03,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-27 10:10:03,100 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:10:03,114 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 10:10:03,121 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 10:10:03,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-27 10:10:03,154 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 10:10:03,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:03,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:10:03,158 INFO L119 LiptonReduction]: Number of co-enabled transitions 4414 [2023-08-27 10:10:06,957 INFO L134 LiptonReduction]: Checked pairs total: 16986 [2023-08-27 10:10:06,957 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-27 10:10:06,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:10:06,975 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;@69799010, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:10:06,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:10:06,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:10:06,977 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 10:10:06,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:06,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:06,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:10:06,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:06,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 616890, now seen corresponding path program 1 times [2023-08-27 10:10:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849903139] [2023-08-27 10:10:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:07,342 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-27 10:10:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849903139] [2023-08-27 10:10:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849903139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:10:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163961759] [2023-08-27 10:10:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:07,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:10:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:10:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:10:07,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2023-08-27 10:10:07,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:07,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:07,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2023-08-27 10:10:07,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:09,756 INFO L124 PetriNetUnfolderBase]: 16914/24193 cut-off events. [2023-08-27 10:10:09,756 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-27 10:10:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46986 conditions, 24193 events. 16914/24193 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 152602 event pairs, 6868 based on Foata normal form. 750/19238 useless extension candidates. Maximal degree in co-relation 46974. Up to 18869 conditions per place. [2023-08-27 10:10:09,979 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 54 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-27 10:10:09,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 259 flow [2023-08-27 10:10:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:10:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:10:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-27 10:10:09,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5299479166666666 [2023-08-27 10:10:09,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-27 10:10:09,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-27 10:10:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:10,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-27 10:10:10,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:10,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:10,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:10,016 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 407 transitions. [2023-08-27 10:10:10,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 259 flow [2023-08-27 10:10:10,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:10:10,023 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 10:10:10,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 10:10:10,030 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 10:10:10,031 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 10:10:10,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:10,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:10,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:10:10,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:10:10,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:10,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1198367550, now seen corresponding path program 1 times [2023-08-27 10:10:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175162725] [2023-08-27 10:10:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:10,110 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-27 10:10:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175162725] [2023-08-27 10:10:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175162725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:10,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:10:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203267854] [2023-08-27 10:10:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:10:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:10:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:10:10,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-08-27 10:10:10,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:10,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:10,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-08-27 10:10:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:12,015 INFO L124 PetriNetUnfolderBase]: 16914/22509 cut-off events. [2023-08-27 10:10:12,015 INFO L125 PetriNetUnfolderBase]: For 1111/1111 co-relation queries the response was YES. [2023-08-27 10:10:12,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46412 conditions, 22509 events. 16914/22509 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 119229 event pairs, 16914 based on Foata normal form. 0/16771 useless extension candidates. Maximal degree in co-relation 46402. Up to 22475 conditions per place. [2023-08-27 10:10:12,124 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-27 10:10:12,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 142 flow [2023-08-27 10:10:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:10:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:10:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-27 10:10:12,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-27 10:10:12,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-27 10:10:12,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-27 10:10:12,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:12,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-27 10:10:12,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:12,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:12,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:12,130 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 368 transitions. [2023-08-27 10:10:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 142 flow [2023-08-27 10:10:12,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:10:12,132 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-27 10:10:12,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-27 10:10:12,133 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-27 10:10:12,133 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-27 10:10:12,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:12,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:12,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:10:12,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:10:12,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:12,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1198367551, now seen corresponding path program 1 times [2023-08-27 10:10:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38344506] [2023-08-27 10:10:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:12,175 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-27 10:10:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38344506] [2023-08-27 10:10:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38344506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:12,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:10:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841065464] [2023-08-27 10:10:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:12,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:10:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:10:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:10:12,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-08-27 10:10:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:12,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:12,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-08-27 10:10:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:13,468 INFO L124 PetriNetUnfolderBase]: 10938/14947 cut-off events. [2023-08-27 10:10:13,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30098 conditions, 14947 events. 10938/14947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 81420 event pairs, 2969 based on Foata normal form. 0/11901 useless extension candidates. Maximal degree in co-relation 30092. Up to 11983 conditions per place. [2023-08-27 10:10:13,548 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-27 10:10:13,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 246 flow [2023-08-27 10:10:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:10:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:10:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-27 10:10:13,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2023-08-27 10:10:13,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-27 10:10:13,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-27 10:10:13,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:13,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-27 10:10:13,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:13,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:13,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:13,554 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 393 transitions. [2023-08-27 10:10:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 246 flow [2023-08-27 10:10:13,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:10:13,556 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-27 10:10:13,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 10:10:13,557 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-27 10:10:13,557 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-27 10:10:13,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:13,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:13,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:13,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:10:13,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:13,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 335681360, now seen corresponding path program 1 times [2023-08-27 10:10:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717607031] [2023-08-27 10:10:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:13,663 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-27 10:10:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717607031] [2023-08-27 10:10:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717607031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:13,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:10:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345943005] [2023-08-27 10:10:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:13,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:13,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-08-27 10:10:13,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:13,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:13,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-08-27 10:10:13,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:14,542 INFO L124 PetriNetUnfolderBase]: 7470/10250 cut-off events. [2023-08-27 10:10:14,542 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2023-08-27 10:10:14,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24390 conditions, 10250 events. 7470/10250 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 54191 event pairs, 2185 based on Foata normal form. 0/9106 useless extension candidates. Maximal degree in co-relation 24382. Up to 3924 conditions per place. [2023-08-27 10:10:14,582 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 70 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-27 10:10:14,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 380 flow [2023-08-27 10:10:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:10:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:10:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-27 10:10:14,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146484375 [2023-08-27 10:10:14,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-27 10:10:14,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-27 10:10:14,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:14,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-27 10:10:14,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:14,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:14,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:14,589 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 4 states and 527 transitions. [2023-08-27 10:10:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 380 flow [2023-08-27 10:10:14,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:10:14,600 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 169 flow [2023-08-27 10:10:14,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 10:10:14,601 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 10:10:14,601 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 169 flow [2023-08-27 10:10:14,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:14,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:14,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:14,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:10:14,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:14,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash 119352109, now seen corresponding path program 1 times [2023-08-27 10:10:14,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040780985] [2023-08-27 10:10:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:14,745 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-27 10:10:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040780985] [2023-08-27 10:10:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040780985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:10:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154173027] [2023-08-27 10:10:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:14,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:14,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:14,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 256 [2023-08-27 10:10:14,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:14,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:14,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 256 [2023-08-27 10:10:14,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:16,996 INFO L124 PetriNetUnfolderBase]: 26337/35566 cut-off events. [2023-08-27 10:10:16,996 INFO L125 PetriNetUnfolderBase]: For 24759/24759 co-relation queries the response was YES. [2023-08-27 10:10:17,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90874 conditions, 35566 events. 26337/35566 cut-off events. For 24759/24759 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 194145 event pairs, 7224 based on Foata normal form. 0/32402 useless extension candidates. Maximal degree in co-relation 90864. Up to 17628 conditions per place. [2023-08-27 10:10:17,401 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 124 selfloop transitions, 14 changer transitions 0/138 dead transitions. [2023-08-27 10:10:17,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 138 transitions, 857 flow [2023-08-27 10:10:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-27 10:10:17,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490625 [2023-08-27 10:10:17,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-27 10:10:17,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-27 10:10:17,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:17,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-27 10:10:17,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:17,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:17,409 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:17,409 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 169 flow. Second operand 5 states and 628 transitions. [2023-08-27 10:10:17,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 138 transitions, 857 flow [2023-08-27 10:10:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 138 transitions, 791 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 10:10:17,431 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 263 flow [2023-08-27 10:10:17,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-27 10:10:17,432 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-27 10:10:17,432 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 263 flow [2023-08-27 10:10:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:17,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:17,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:10:17,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:17,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -595113498, now seen corresponding path program 1 times [2023-08-27 10:10:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018151037] [2023-08-27 10:10:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:10:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018151037] [2023-08-27 10:10:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018151037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:10:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158689675] [2023-08-27 10:10:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:17,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:10:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:10:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:10:17,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-27 10:10:17,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:17,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:17,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-27 10:10:17,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:19,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L804-->L811: Formula: (let ((.cse5 (not (= (mod v_~a$r_buff0_thd3~0_22 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_121 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_18 256) 0)))) (let ((.cse3 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_122 256) 0))))) (and (= v_~a$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd3~0_21 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$w_buff1_used~0_106 256) 0)))) 0 v_~a$r_buff1_thd3~0_18)) (= v_~a~0_56 (ite .cse2 v_~a$w_buff0~0_32 (ite .cse3 v_~a$w_buff1~0_37 v_~a~0_57))) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_107) v_~a$w_buff1_used~0_106) (= v_~a$r_buff0_thd3~0_21 (ite .cse4 0 v_~a$r_buff0_thd3~0_22)) (= (ite .cse2 0 v_~a$w_buff0_used~0_122) v_~a$w_buff0_used~0_121)))) InVars {~a~0=v_~a~0_57, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_122, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_107} OutVars{~a~0=v_~a~0_56, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_121, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_106} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [Black: 164#(<= ~__unbuffered_cnt~0 0), 3#ULTIMATE.startEXITtrue, 117#L811true, Black: 170#(<= ~__unbuffered_cnt~0 1), 112#P0EXITtrue, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 90#P3EXITtrue, Black: 173#true, 49#L784true, P2Thread1of1ForFork0InUse, Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 160#(<= 0 ~__unbuffered_cnt~0), P1Thread1of1ForFork3InUse, 184#true, 176#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))]) [2023-08-27 10:10:19,326 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-27 10:10:19,326 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 10:10:19,326 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 10:10:19,326 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 10:10:19,512 INFO L124 PetriNetUnfolderBase]: 15639/22524 cut-off events. [2023-08-27 10:10:19,513 INFO L125 PetriNetUnfolderBase]: For 17449/18068 co-relation queries the response was YES. [2023-08-27 10:10:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65014 conditions, 22524 events. 15639/22524 cut-off events. For 17449/18068 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 140833 event pairs, 3289 based on Foata normal form. 981/20931 useless extension candidates. Maximal degree in co-relation 65000. Up to 16935 conditions per place. [2023-08-27 10:10:19,667 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 93 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-27 10:10:19,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 693 flow [2023-08-27 10:10:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-27 10:10:19,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48359375 [2023-08-27 10:10:19,670 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-27 10:10:19,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-27 10:10:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:19,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-27 10:10:19,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:19,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:19,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:19,677 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 263 flow. Second operand 5 states and 619 transitions. [2023-08-27 10:10:19,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 693 flow [2023-08-27 10:10:19,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 693 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:10:19,721 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 330 flow [2023-08-27 10:10:19,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-08-27 10:10:19,722 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-27 10:10:19,722 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 330 flow [2023-08-27 10:10:19,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:19,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:19,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:19,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:10:19,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:19,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2110036942, now seen corresponding path program 1 times [2023-08-27 10:10:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201286892] [2023-08-27 10:10:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:19,912 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-27 10:10:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201286892] [2023-08-27 10:10:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201286892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:10:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715881636] [2023-08-27 10:10:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:19,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:10:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:10:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:10:19,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-27 10:10:19,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:19,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:19,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-27 10:10:19,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:21,167 INFO L124 PetriNetUnfolderBase]: 10816/16149 cut-off events. [2023-08-27 10:10:21,167 INFO L125 PetriNetUnfolderBase]: For 17918/18360 co-relation queries the response was YES. [2023-08-27 10:10:21,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50539 conditions, 16149 events. 10816/16149 cut-off events. For 17918/18360 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 103172 event pairs, 2181 based on Foata normal form. 646/15235 useless extension candidates. Maximal degree in co-relation 50520. Up to 6343 conditions per place. [2023-08-27 10:10:21,267 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 112 selfloop transitions, 19 changer transitions 0/140 dead transitions. [2023-08-27 10:10:21,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 884 flow [2023-08-27 10:10:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:10:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:10:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-27 10:10:21,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48270089285714285 [2023-08-27 10:10:21,269 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-27 10:10:21,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-27 10:10:21,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:21,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-27 10:10:21,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:21,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:21,274 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:21,274 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 330 flow. Second operand 7 states and 865 transitions. [2023-08-27 10:10:21,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 884 flow [2023-08-27 10:10:21,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:10:21,420 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 402 flow [2023-08-27 10:10:21,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2023-08-27 10:10:21,421 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-27 10:10:21,421 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 402 flow [2023-08-27 10:10:21,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:21,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:21,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:21,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:10:21,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:21,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 722312766, now seen corresponding path program 1 times [2023-08-27 10:10:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847006291] [2023-08-27 10:10:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:21,500 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-27 10:10:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847006291] [2023-08-27 10:10:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847006291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:10:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897892989] [2023-08-27 10:10:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:21,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:10:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:10:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:10:21,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-08-27 10:10:21,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:21,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:21,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-08-27 10:10:21,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:22,612 INFO L124 PetriNetUnfolderBase]: 9250/13644 cut-off events. [2023-08-27 10:10:22,612 INFO L125 PetriNetUnfolderBase]: For 22693/23122 co-relation queries the response was YES. [2023-08-27 10:10:22,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46218 conditions, 13644 events. 9250/13644 cut-off events. For 22693/23122 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 84517 event pairs, 1851 based on Foata normal form. 14/13157 useless extension candidates. Maximal degree in co-relation 46196. Up to 4735 conditions per place. [2023-08-27 10:10:22,673 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 97 selfloop transitions, 21 changer transitions 0/127 dead transitions. [2023-08-27 10:10:22,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 880 flow [2023-08-27 10:10:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-27 10:10:22,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50859375 [2023-08-27 10:10:22,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-27 10:10:22,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-27 10:10:22,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:22,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-27 10:10:22,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:22,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:22,679 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:22,679 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 402 flow. Second operand 5 states and 651 transitions. [2023-08-27 10:10:22,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 880 flow [2023-08-27 10:10:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 846 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:10:22,840 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 462 flow [2023-08-27 10:10:22,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2023-08-27 10:10:22,841 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-27 10:10:22,841 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 462 flow [2023-08-27 10:10:22,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:22,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:22,841 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-27 10:10:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:10:22,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:22,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1374182666, now seen corresponding path program 1 times [2023-08-27 10:10:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486501469] [2023-08-27 10:10:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:23,004 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-27 10:10:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486501469] [2023-08-27 10:10:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486501469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:10:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005552311] [2023-08-27 10:10:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:10:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:10:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:10:23,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-27 10:10:23,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 462 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:23,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:23,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-27 10:10:23,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:24,143 INFO L124 PetriNetUnfolderBase]: 8017/11739 cut-off events. [2023-08-27 10:10:24,143 INFO L125 PetriNetUnfolderBase]: For 22462/22872 co-relation queries the response was YES. [2023-08-27 10:10:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40720 conditions, 11739 events. 8017/11739 cut-off events. For 22462/22872 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 71646 event pairs, 1249 based on Foata normal form. 194/11466 useless extension candidates. Maximal degree in co-relation 40697. Up to 2754 conditions per place. [2023-08-27 10:10:24,227 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 133 selfloop transitions, 28 changer transitions 4/174 dead transitions. [2023-08-27 10:10:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1206 flow [2023-08-27 10:10:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:10:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:10:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2023-08-27 10:10:24,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813368055555556 [2023-08-27 10:10:24,231 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2023-08-27 10:10:24,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2023-08-27 10:10:24,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:24,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2023-08-27 10:10:24,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:24,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:24,238 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:24,239 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 462 flow. Second operand 9 states and 1109 transitions. [2023-08-27 10:10:24,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1206 flow [2023-08-27 10:10:24,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1140 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:10:24,771 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 522 flow [2023-08-27 10:10:24,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2023-08-27 10:10:24,772 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-27 10:10:24,772 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 522 flow [2023-08-27 10:10:24,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:24,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:24,772 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-27 10:10:24,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:10:24,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:24,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash 90248322, now seen corresponding path program 1 times [2023-08-27 10:10:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581370306] [2023-08-27 10:10:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:24,899 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-27 10:10:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581370306] [2023-08-27 10:10:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581370306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:10:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260975212] [2023-08-27 10:10:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:10:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:10:24,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:10:24,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-08-27 10:10:24,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:24,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:24,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-08-27 10:10:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:25,877 INFO L124 PetriNetUnfolderBase]: 7906/11552 cut-off events. [2023-08-27 10:10:25,878 INFO L125 PetriNetUnfolderBase]: For 24349/24751 co-relation queries the response was YES. [2023-08-27 10:10:25,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41815 conditions, 11552 events. 7906/11552 cut-off events. For 24349/24751 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 70295 event pairs, 1786 based on Foata normal form. 1/11169 useless extension candidates. Maximal degree in co-relation 41789. Up to 4735 conditions per place. [2023-08-27 10:10:25,923 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 82 selfloop transitions, 28 changer transitions 11/127 dead transitions. [2023-08-27 10:10:25,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 127 transitions, 940 flow [2023-08-27 10:10:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:10:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:10:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-27 10:10:25,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2023-08-27 10:10:25,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-27 10:10:25,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-27 10:10:25,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:25,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-27 10:10:25,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:25,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:25,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:25,930 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 522 flow. Second operand 6 states and 760 transitions. [2023-08-27 10:10:25,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 127 transitions, 940 flow [2023-08-27 10:10:26,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 886 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 10:10:26,566 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 452 flow [2023-08-27 10:10:26,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-08-27 10:10:26,567 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-27 10:10:26,567 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 452 flow [2023-08-27 10:10:26,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:26,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:26,568 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-27 10:10:26,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:10:26,568 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:26,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1837366666, now seen corresponding path program 1 times [2023-08-27 10:10:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17429226] [2023-08-27 10:10:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:27,028 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-27 10:10:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17429226] [2023-08-27 10:10:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17429226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:10:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072645643] [2023-08-27 10:10:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:27,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:10:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:10:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:10:27,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 256 [2023-08-27 10:10:27,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 452 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:27,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:27,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 256 [2023-08-27 10:10:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:29,423 INFO L124 PetriNetUnfolderBase]: 16740/23669 cut-off events. [2023-08-27 10:10:29,424 INFO L125 PetriNetUnfolderBase]: For 58819/58819 co-relation queries the response was YES. [2023-08-27 10:10:29,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85006 conditions, 23669 events. 16740/23669 cut-off events. For 58819/58819 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 140859 event pairs, 330 based on Foata normal form. 24/23693 useless extension candidates. Maximal degree in co-relation 84980. Up to 8163 conditions per place. [2023-08-27 10:10:29,498 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 210 selfloop transitions, 58 changer transitions 188/456 dead transitions. [2023-08-27 10:10:29,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 456 transitions, 3994 flow [2023-08-27 10:10:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 10:10:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 10:10:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2331 transitions. [2023-08-27 10:10:29,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2023-08-27 10:10:29,504 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2331 transitions. [2023-08-27 10:10:29,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2331 transitions. [2023-08-27 10:10:29,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:29,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2331 transitions. [2023-08-27 10:10:29,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 111.0) internal successors, (2331), 21 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:29,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 256.0) internal successors, (5632), 22 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:29,516 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 256.0) internal successors, (5632), 22 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:29,516 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 452 flow. Second operand 21 states and 2331 transitions. [2023-08-27 10:10:29,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 456 transitions, 3994 flow [2023-08-27 10:10:30,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 456 transitions, 3307 flow, removed 48 selfloop flow, removed 7 redundant places. [2023-08-27 10:10:30,109 INFO L231 Difference]: Finished difference. Result has 100 places, 101 transitions, 765 flow [2023-08-27 10:10:30,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=765, PETRI_PLACES=100, PETRI_TRANSITIONS=101} [2023-08-27 10:10:30,110 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 48 predicate places. [2023-08-27 10:10:30,110 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 101 transitions, 765 flow [2023-08-27 10:10:30,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:30,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:30,111 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-27 10:10:30,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:10:30,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:30,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash -552232016, now seen corresponding path program 1 times [2023-08-27 10:10:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902973051] [2023-08-27 10:10:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:30,865 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-27 10:10:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902973051] [2023-08-27 10:10:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902973051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:10:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142186182] [2023-08-27 10:10:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:30,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:10:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:10:30,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:10:30,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 256 [2023-08-27 10:10:30,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 765 flow. Second operand has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:30,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:30,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 256 [2023-08-27 10:10:30,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:31,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][92], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 266#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 277#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 241#(not (= ~y~0 0)), Black: 225#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 218#(<= ~__unbuffered_cnt~0 2), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 219#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 272#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0))), Black: 270#(and (= ~a$w_buff0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 117#L811true, 173#true, 295#true, 197#(<= ~__unbuffered_cnt~0 1), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 176#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 160#(<= 0 ~__unbuffered_cnt~0), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-27 10:10:31,758 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:10:31,758 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:31,758 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:31,759 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:31,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][92], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 218#(<= ~__unbuffered_cnt~0 2), Black: 197#(<= ~__unbuffered_cnt~0 1), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 266#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), 75#P2EXITtrue, Black: 277#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 241#(not (= ~y~0 0)), Black: 225#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 219#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 272#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0))), Black: 270#(and (= ~a$w_buff0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 173#true, 295#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 176#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 160#(<= 0 ~__unbuffered_cnt~0), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2023-08-27 10:10:31,803 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:31,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:31,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:31,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:31,956 INFO L124 PetriNetUnfolderBase]: 5305/8324 cut-off events. [2023-08-27 10:10:31,956 INFO L125 PetriNetUnfolderBase]: For 33401/33915 co-relation queries the response was YES. [2023-08-27 10:10:32,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38116 conditions, 8324 events. 5305/8324 cut-off events. For 33401/33915 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 51109 event pairs, 784 based on Foata normal form. 190/8403 useless extension candidates. Maximal degree in co-relation 38080. Up to 4870 conditions per place. [2023-08-27 10:10:32,033 INFO L140 encePairwiseOnDemand]: 247/256 looper letters, 142 selfloop transitions, 22 changer transitions 54/239 dead transitions. [2023-08-27 10:10:32,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 239 transitions, 2098 flow [2023-08-27 10:10:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:10:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:10:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 926 transitions. [2023-08-27 10:10:32,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521484375 [2023-08-27 10:10:32,036 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 926 transitions. [2023-08-27 10:10:32,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 926 transitions. [2023-08-27 10:10:32,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:32,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 926 transitions. [2023-08-27 10:10:32,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:32,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:32,041 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:32,041 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 765 flow. Second operand 8 states and 926 transitions. [2023-08-27 10:10:32,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 239 transitions, 2098 flow [2023-08-27 10:10:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 239 transitions, 1946 flow, removed 39 selfloop flow, removed 11 redundant places. [2023-08-27 10:10:32,303 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 920 flow [2023-08-27 10:10:32,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=920, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2023-08-27 10:10:32,304 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-27 10:10:32,304 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 920 flow [2023-08-27 10:10:32,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:32,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:32,304 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-27 10:10:32,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:10:32,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:32,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1193681480, now seen corresponding path program 2 times [2023-08-27 10:10:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002272504] [2023-08-27 10:10:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:32,492 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-27 10:10:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002272504] [2023-08-27 10:10:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002272504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:32,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:10:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824799557] [2023-08-27 10:10:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:10:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:10:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:10:32,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 256 [2023-08-27 10:10:32,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 920 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:32,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:32,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 256 [2023-08-27 10:10:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:33,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][50], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), 319#(<= ~__unbuffered_cnt~0 1), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 277#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 241#(not (= ~y~0 0)), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 218#(<= ~__unbuffered_cnt~0 2), 117#L811true, 295#true, 197#(<= ~__unbuffered_cnt~0 1), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 308#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 176#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 297#(and (= ~a~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), 160#(<= 0 ~__unbuffered_cnt~0), Black: 299#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 301#(not (= ~__unbuffered_p3_EAX~0 0)), Black: 304#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 306#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0))]) [2023-08-27 10:10:33,158 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-27 10:10:33,158 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:10:33,159 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:10:33,159 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-27 10:10:33,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][158], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), 218#(<= ~__unbuffered_cnt~0 2), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 197#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 75#P2EXITtrue, Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 277#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 241#(not (= ~y~0 0)), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 320#(<= ~__unbuffered_cnt~0 2), 295#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 176#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 308#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 297#(and (= ~a~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 299#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 160#(<= 0 ~__unbuffered_cnt~0), Black: 301#(not (= ~__unbuffered_p3_EAX~0 0)), Black: 304#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 306#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0))]) [2023-08-27 10:10:33,178 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:33,178 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:33,178 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:33,178 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:33,262 INFO L124 PetriNetUnfolderBase]: 4705/7266 cut-off events. [2023-08-27 10:10:33,262 INFO L125 PetriNetUnfolderBase]: For 36748/37327 co-relation queries the response was YES. [2023-08-27 10:10:33,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34921 conditions, 7266 events. 4705/7266 cut-off events. For 36748/37327 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 44665 event pairs, 494 based on Foata normal form. 276/7388 useless extension candidates. Maximal degree in co-relation 34890. Up to 2980 conditions per place. [2023-08-27 10:10:33,301 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 180 selfloop transitions, 18 changer transitions 33/252 dead transitions. [2023-08-27 10:10:33,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 252 transitions, 2394 flow [2023-08-27 10:10:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:10:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:10:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 948 transitions. [2023-08-27 10:10:33,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462890625 [2023-08-27 10:10:33,304 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 948 transitions. [2023-08-27 10:10:33,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 948 transitions. [2023-08-27 10:10:33,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:33,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 948 transitions. [2023-08-27 10:10:33,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:33,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:33,309 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:33,309 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 920 flow. Second operand 8 states and 948 transitions. [2023-08-27 10:10:33,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 252 transitions, 2394 flow [2023-08-27 10:10:33,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 252 transitions, 2338 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-08-27 10:10:33,511 INFO L231 Difference]: Finished difference. Result has 86 places, 118 transitions, 933 flow [2023-08-27 10:10:33,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=933, PETRI_PLACES=86, PETRI_TRANSITIONS=118} [2023-08-27 10:10:33,511 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-27 10:10:33,511 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 118 transitions, 933 flow [2023-08-27 10:10:33,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:33,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:33,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:33,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:10:33,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:33,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1390231046, now seen corresponding path program 1 times [2023-08-27 10:10:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878970255] [2023-08-27 10:10:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:34,195 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-27 10:10:34,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878970255] [2023-08-27 10:10:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878970255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:34,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:34,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:10:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912800625] [2023-08-27 10:10:34,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:34,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:10:34,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:34,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:10:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:10:34,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 256 [2023-08-27 10:10:34,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 118 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:34,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:34,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 256 [2023-08-27 10:10:34,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:35,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][123], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), 319#(<= ~__unbuffered_cnt~0 1), Black: 322#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 324#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 3)), Black: 321#(<= ~__unbuffered_cnt~0 3), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 241#(not (= ~y~0 0)), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 218#(<= ~__unbuffered_cnt~0 2), 117#L811true, 295#true, 197#(<= ~__unbuffered_cnt~0 1), 329#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 297#(and (= ~a~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 299#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 160#(<= 0 ~__unbuffered_cnt~0), Black: 304#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0))]) [2023-08-27 10:10:35,063 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 10:10:35,063 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:35,063 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:35,064 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 10:10:35,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][123], [60#L791true, Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 322#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 324#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 3)), Black: 321#(<= ~__unbuffered_cnt~0 3), 218#(<= ~__unbuffered_cnt~0 2), 263#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 197#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 90#P3EXITtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 128#L764true, Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 251#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 259#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 253#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), 75#P2EXITtrue, Black: 241#(not (= ~y~0 0)), Black: 255#(and (= ~a$w_buff0~0 0) (not (= ~y~0 0))), Black: 242#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 320#(<= ~__unbuffered_cnt~0 2), 295#true, 329#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 143#L868-3true, Black: 297#(and (= ~a~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 178#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 299#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 160#(<= 0 ~__unbuffered_cnt~0), Black: 304#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0))]) [2023-08-27 10:10:35,125 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:10:35,125 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:35,125 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:35,125 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:10:35,231 INFO L124 PetriNetUnfolderBase]: 5679/8986 cut-off events. [2023-08-27 10:10:35,231 INFO L125 PetriNetUnfolderBase]: For 40694/41021 co-relation queries the response was YES. [2023-08-27 10:10:35,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44783 conditions, 8986 events. 5679/8986 cut-off events. For 40694/41021 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 56881 event pairs, 757 based on Foata normal form. 48/8941 useless extension candidates. Maximal degree in co-relation 44750. Up to 4821 conditions per place. [2023-08-27 10:10:35,295 INFO L140 encePairwiseOnDemand]: 246/256 looper letters, 125 selfloop transitions, 36 changer transitions 52/234 dead transitions. [2023-08-27 10:10:35,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 234 transitions, 2213 flow [2023-08-27 10:10:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:10:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:10:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2023-08-27 10:10:35,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45458984375 [2023-08-27 10:10:35,298 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2023-08-27 10:10:35,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2023-08-27 10:10:35,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:35,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2023-08-27 10:10:35,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:35,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:35,304 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:35,304 INFO L175 Difference]: Start difference. First operand has 86 places, 118 transitions, 933 flow. Second operand 8 states and 931 transitions. [2023-08-27 10:10:35,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 234 transitions, 2213 flow [2023-08-27 10:10:35,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 234 transitions, 1979 flow, removed 41 selfloop flow, removed 7 redundant places. [2023-08-27 10:10:35,564 INFO L231 Difference]: Finished difference. Result has 89 places, 121 transitions, 1000 flow [2023-08-27 10:10:35,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1000, PETRI_PLACES=89, PETRI_TRANSITIONS=121} [2023-08-27 10:10:35,565 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-27 10:10:35,565 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 121 transitions, 1000 flow [2023-08-27 10:10:35,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:35,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:35,566 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-27 10:10:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:10:35,566 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:35,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 159246370, now seen corresponding path program 2 times [2023-08-27 10:10:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:35,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960230612] [2023-08-27 10:10:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:35,759 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-27 10:10:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960230612] [2023-08-27 10:10:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960230612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:10:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012297612] [2023-08-27 10:10:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:35,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:10:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:10:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:10:35,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 256 [2023-08-27 10:10:35,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 121 transitions, 1000 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:35,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:35,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 256 [2023-08-27 10:10:35,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:36,858 INFO L124 PetriNetUnfolderBase]: 7632/11862 cut-off events. [2023-08-27 10:10:36,859 INFO L125 PetriNetUnfolderBase]: For 67404/67934 co-relation queries the response was YES. [2023-08-27 10:10:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60516 conditions, 11862 events. 7632/11862 cut-off events. For 67404/67934 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 77356 event pairs, 1646 based on Foata normal form. 185/11941 useless extension candidates. Maximal degree in co-relation 60486. Up to 4820 conditions per place. [2023-08-27 10:10:36,929 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 134 selfloop transitions, 1 changer transitions 94/243 dead transitions. [2023-08-27 10:10:36,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 243 transitions, 2544 flow [2023-08-27 10:10:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:10:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:10:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-27 10:10:36,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2023-08-27 10:10:36,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-27 10:10:36,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-27 10:10:36,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:36,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-27 10:10:36,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:36,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:36,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:36,934 INFO L175 Difference]: Start difference. First operand has 89 places, 121 transitions, 1000 flow. Second operand 5 states and 592 transitions. [2023-08-27 10:10:36,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 243 transitions, 2544 flow [2023-08-27 10:10:37,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 243 transitions, 2376 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-27 10:10:37,498 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 768 flow [2023-08-27 10:10:37,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=768, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2023-08-27 10:10:37,498 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-27 10:10:37,498 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 768 flow [2023-08-27 10:10:37,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:37,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:37,499 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-27 10:10:37,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:10:37,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:37,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -416226710, now seen corresponding path program 3 times [2023-08-27 10:10:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601493844] [2023-08-27 10:10:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:38,383 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-27 10:10:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:38,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601493844] [2023-08-27 10:10:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601493844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:10:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963760838] [2023-08-27 10:10:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:10:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:10:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:10:38,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 256 [2023-08-27 10:10:38,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:38,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:38,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 256 [2023-08-27 10:10:38,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:39,375 INFO L124 PetriNetUnfolderBase]: 4971/7702 cut-off events. [2023-08-27 10:10:39,376 INFO L125 PetriNetUnfolderBase]: For 29467/29467 co-relation queries the response was YES. [2023-08-27 10:10:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36069 conditions, 7702 events. 4971/7702 cut-off events. For 29467/29467 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 44957 event pairs, 649 based on Foata normal form. 1/7703 useless extension candidates. Maximal degree in co-relation 36039. Up to 2024 conditions per place. [2023-08-27 10:10:39,406 INFO L140 encePairwiseOnDemand]: 244/256 looper letters, 149 selfloop transitions, 40 changer transitions 83/272 dead transitions. [2023-08-27 10:10:39,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 272 transitions, 2471 flow [2023-08-27 10:10:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:10:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:10:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1074 transitions. [2023-08-27 10:10:39,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41953125 [2023-08-27 10:10:39,408 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1074 transitions. [2023-08-27 10:10:39,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1074 transitions. [2023-08-27 10:10:39,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:39,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1074 transitions. [2023-08-27 10:10:39,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.4) internal successors, (1074), 10 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:39,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 256.0) internal successors, (2816), 11 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:39,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 256.0) internal successors, (2816), 11 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:39,414 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 768 flow. Second operand 10 states and 1074 transitions. [2023-08-27 10:10:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 272 transitions, 2471 flow [2023-08-27 10:10:39,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 272 transitions, 2417 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-08-27 10:10:39,607 INFO L231 Difference]: Finished difference. Result has 95 places, 101 transitions, 922 flow [2023-08-27 10:10:39,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=95, PETRI_TRANSITIONS=101} [2023-08-27 10:10:39,608 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2023-08-27 10:10:39,608 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 922 flow [2023-08-27 10:10:39,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:39,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:39,609 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-27 10:10:39,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:10:39,609 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:39,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash 12410552, now seen corresponding path program 4 times [2023-08-27 10:10:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792685864] [2023-08-27 10:10:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:40,362 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-27 10:10:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792685864] [2023-08-27 10:10:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792685864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:10:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808032493] [2023-08-27 10:10:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:40,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:10:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:10:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:10:40,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 256 [2023-08-27 10:10:40,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 922 flow. Second operand has 9 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:40,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:40,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 256 [2023-08-27 10:10:40,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:10:41,155 INFO L124 PetriNetUnfolderBase]: 3407/5398 cut-off events. [2023-08-27 10:10:41,155 INFO L125 PetriNetUnfolderBase]: For 30128/30128 co-relation queries the response was YES. [2023-08-27 10:10:41,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 5398 events. 3407/5398 cut-off events. For 30128/30128 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 30613 event pairs, 296 based on Foata normal form. 1/5399 useless extension candidates. Maximal degree in co-relation 27788. Up to 1863 conditions per place. [2023-08-27 10:10:41,182 INFO L140 encePairwiseOnDemand]: 244/256 looper letters, 123 selfloop transitions, 37 changer transitions 51/211 dead transitions. [2023-08-27 10:10:41,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 211 transitions, 2052 flow [2023-08-27 10:10:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:10:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:10:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 964 transitions. [2023-08-27 10:10:41,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4184027777777778 [2023-08-27 10:10:41,184 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 964 transitions. [2023-08-27 10:10:41,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 964 transitions. [2023-08-27 10:10:41,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:10:41,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 964 transitions. [2023-08-27 10:10:41,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:41,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:41,188 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:41,188 INFO L175 Difference]: Start difference. First operand has 95 places, 101 transitions, 922 flow. Second operand 9 states and 964 transitions. [2023-08-27 10:10:41,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 211 transitions, 2052 flow [2023-08-27 10:10:41,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 211 transitions, 2010 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-27 10:10:41,306 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 1015 flow [2023-08-27 10:10:41,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2023-08-27 10:10:41,307 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-27 10:10:41,307 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 1015 flow [2023-08-27 10:10:41,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:41,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:41,307 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-27 10:10:41,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:10:41,308 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:41,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -222907176, now seen corresponding path program 5 times [2023-08-27 10:10:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493692914] [2023-08-27 10:10:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:10:41,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:10:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:10:41,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:10:41,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:10:41,463 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:10:41,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:10:41,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:10:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:10:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:10:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:10:41,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:10:41,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:10:41,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:10:41,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:10:41,471 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:10:41,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:10:41,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:10:41,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:10:41 BasicIcfg [2023-08-27 10:10:41,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:10:41,573 INFO L158 Benchmark]: Toolchain (without parser) took 40065.92ms. Allocated memory was 358.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 334.0MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-27 10:10:41,573 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 358.6MB. Free memory was 336.0MB in the beginning and 335.9MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:10:41,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.60ms. Allocated memory is still 358.6MB. Free memory was 333.7MB in the beginning and 309.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:10:41,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.10ms. Allocated memory is still 358.6MB. Free memory was 309.6MB in the beginning and 307.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:10:41,574 INFO L158 Benchmark]: Boogie Preprocessor took 57.79ms. Allocated memory is still 358.6MB. Free memory was 307.1MB in the beginning and 305.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:10:41,574 INFO L158 Benchmark]: RCFGBuilder took 679.46ms. Allocated memory is still 358.6MB. Free memory was 304.8MB in the beginning and 309.6MB in the end (delta: -4.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2023-08-27 10:10:41,574 INFO L158 Benchmark]: TraceAbstraction took 38663.01ms. Allocated memory was 358.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 309.6MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-27 10:10:41,576 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 was 336.0MB in the beginning and 335.9MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 594.60ms. Allocated memory is still 358.6MB. Free memory was 333.7MB in the beginning and 309.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.10ms. Allocated memory is still 358.6MB. Free memory was 309.6MB in the beginning and 307.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.79ms. Allocated memory is still 358.6MB. Free memory was 307.1MB in the beginning and 305.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 679.46ms. Allocated memory is still 358.6MB. Free memory was 304.8MB in the beginning and 309.6MB in the end (delta: -4.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. * TraceAbstraction took 38663.01ms. Allocated memory was 358.6MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 309.6MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 147 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 4414 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 16986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5226, independent: 4860, independent conditional: 0, independent unconditional: 4860, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2349, independent: 2283, independent conditional: 0, independent unconditional: 2283, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5226, independent: 2577, independent conditional: 0, independent unconditional: 2577, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 2349, unknown conditional: 0, unknown unconditional: 2349] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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 a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L793] EXPR 2 __unbuffered_cnt + 1 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L773] EXPR 1 __unbuffered_cnt + 1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L813] EXPR 3 __unbuffered_cnt + 1 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L846] EXPR 4 __unbuffered_cnt + 1 [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] 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", "mix051_power.oepc_power.opt_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=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=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: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 23 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: 38.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1139 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1139 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3426 IncrementalHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 37 mSDtfsCounter, 3426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1015occurred in iteration=17, InterpolantAutomatonStates: 119, 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.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 2546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-27 10:10:41,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...