/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:18:51,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:18:51,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:18:51,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:18:51,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:18:51,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:18:51,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:18:51,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:18:51,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:18:51,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:18:51,419 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:18:51,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:18:51,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:18:51,420 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:18:51,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:18:51,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:18:51,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:18:51,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:18:51,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:18:51,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:18:51,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:18:51,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:18:51,422 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:18:51,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:18:51,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:18:51,422 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:18:51,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:18:51,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:18:51,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:18:51,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:18:51,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:18:51,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:18:51,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:18:51,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:18:51,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:18:51,424 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:18:51,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:18:51,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:18:51,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:18:51,651 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:18:51,653 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:18:51,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:18:52,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:18:52,811 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:18:52,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:18:52,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ea8017e/18039c0ce5e04ac88cdf9cde64e4e74b/FLAG1cff9fb26 [2023-08-26 21:18:52,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ea8017e/18039c0ce5e04ac88cdf9cde64e4e74b [2023-08-26 21:18:52,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:18:52,849 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:18:52,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:18:52,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:18:52,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:18:52,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:18:52" (1/1) ... [2023-08-26 21:18:52,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f349b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:52, skipping insertion in model container [2023-08-26 21:18:52,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:18:52" (1/1) ... [2023-08-26 21:18:52,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:18:53,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:18:53,209 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:18:53,232 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:18:53,239 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:18:53,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:18:53,288 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:18:53,288 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:18:53,292 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:18:53,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53 WrapperNode [2023-08-26 21:18:53,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:18:53,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:18:53,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:18:53,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:18:53,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,331 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-26 21:18:53,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:18:53,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:18:53,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:18:53,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:18:53,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:18:53,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:18:53,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:18:53,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:18:53,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (1/1) ... [2023-08-26 21:18:53,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:18:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:18:53,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:18:53,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:18:53,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:18:53,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:18:53,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:18:53,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:18:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:18:53,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:18:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:18:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:18:53,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:18:53,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:18:53,427 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:18:53,520 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:18:53,521 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:18:53,849 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:18:53,952 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:18:53,953 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:18:53,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:18:53 BoogieIcfgContainer [2023-08-26 21:18:53,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:18:53,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:18:53,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:18:53,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:18:53,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:18:52" (1/3) ... [2023-08-26 21:18:53,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc5f365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:18:53, skipping insertion in model container [2023-08-26 21:18:53,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:53" (2/3) ... [2023-08-26 21:18:53,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc5f365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:18:53, skipping insertion in model container [2023-08-26 21:18:53,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:18:53" (3/3) ... [2023-08-26 21:18:53,961 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:18:53,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:18:53,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:18:53,972 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:18:54,023 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:18:54,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:18:54,121 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:18:54,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:18:54,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:18:54,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:18:54,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:54,134 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:18:54,143 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:54,146 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:54,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:54,176 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:18:54,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:18:54,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:18:54,180 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-26 21:18:57,316 INFO L134 LiptonReduction]: Checked pairs total: 17292 [2023-08-26 21:18:57,316 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-26 21:18:57,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:18:57,328 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;@b6ec2ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:18:57,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:18:57,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:18:57,330 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 21:18:57,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:18:57,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:57,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:18:57,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:18:57,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 627853, now seen corresponding path program 1 times [2023-08-26 21:18:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317033819] [2023-08-26 21:18:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:57,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:18:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317033819] [2023-08-26 21:18:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317033819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:18:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647667812] [2023-08-26 21:18:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:57,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:18:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:18:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:18:57,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 263 [2023-08-26 21:18:57,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:57,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:57,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 263 [2023-08-26 21:18:57,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:18:59,365 INFO L124 PetriNetUnfolderBase]: 16914/24237 cut-off events. [2023-08-26 21:18:59,366 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-26 21:18:59,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47030 conditions, 24237 events. 16914/24237 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 152722 event pairs, 6868 based on Foata normal form. 0/19284 useless extension candidates. Maximal degree in co-relation 47018. Up to 18869 conditions per place. [2023-08-26 21:18:59,504 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 54 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-26 21:18:59,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 259 flow [2023-08-26 21:18:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:18:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:18:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-26 21:18:59,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272496831432193 [2023-08-26 21:18:59,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-26 21:18:59,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-26 21:18:59,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:18:59,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-26 21:18:59,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:59,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:59,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:59,523 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 416 transitions. [2023-08-26 21:18:59,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 259 flow [2023-08-26 21:18:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:18:59,527 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:18:59,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, 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-26 21:18:59,531 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:18:59,531 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:18:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:59,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:18:59,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:18:59,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:18:59,531 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-26 21:18:59,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:18:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1524972241, now seen corresponding path program 1 times [2023-08-26 21:18:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:18:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336553018] [2023-08-26 21:18:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:18:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:18:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:18:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:18:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:18:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336553018] [2023-08-26 21:18:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336553018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:18:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:18:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:18:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021088740] [2023-08-26 21:18:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:18:59,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:18:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:18:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:18:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:18:59,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-08-26 21:18:59,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:18:59,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:18:59,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-08-26 21:18:59,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:01,243 INFO L124 PetriNetUnfolderBase]: 16799/23025 cut-off events. [2023-08-26 21:19:01,243 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2023-08-26 21:19:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47325 conditions, 23025 events. 16799/23025 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 131691 event pairs, 4684 based on Foata normal form. 0/16723 useless extension candidates. Maximal degree in co-relation 47315. Up to 19854 conditions per place. [2023-08-26 21:19:01,325 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 55 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2023-08-26 21:19:01,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 266 flow [2023-08-26 21:19:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:19:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:19:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 21:19:01,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196451204055766 [2023-08-26 21:19:01,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 21:19:01,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 21:19:01,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:01,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 21:19:01,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,332 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 410 transitions. [2023-08-26 21:19:01,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 266 flow [2023-08-26 21:19:01,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:01,334 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-26 21:19:01,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 21:19:01,335 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:19:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-26 21:19:01,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:01,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:01,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:19:01,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:01,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1452328493, now seen corresponding path program 1 times [2023-08-26 21:19:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805485232] [2023-08-26 21:19:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805485232] [2023-08-26 21:19:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805485232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089022228] [2023-08-26 21:19:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:01,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:01,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-08-26 21:19:01,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:01,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-08-26 21:19:01,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:02,570 INFO L124 PetriNetUnfolderBase]: 10935/14925 cut-off events. [2023-08-26 21:19:02,571 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2023-08-26 21:19:02,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35836 conditions, 14925 events. 10935/14925 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 80979 event pairs, 3052 based on Foata normal form. 0/12439 useless extension candidates. Maximal degree in co-relation 35825. Up to 11753 conditions per place. [2023-08-26 21:19:02,644 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-26 21:19:02,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 275 flow [2023-08-26 21:19:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 21:19:02,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49049429657794674 [2023-08-26 21:19:02,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 21:19:02,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 21:19:02,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:02,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 21:19:02,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:02,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:02,649 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:02,649 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 4 states and 516 transitions. [2023-08-26 21:19:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 275 flow [2023-08-26 21:19:02,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:02,659 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 120 flow [2023-08-26 21:19:02,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-26 21:19:02,660 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-26 21:19:02,660 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 120 flow [2023-08-26 21:19:02,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:02,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:02,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:02,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:19:02,661 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-26 21:19:02,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1452328494, now seen corresponding path program 1 times [2023-08-26 21:19:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982489811] [2023-08-26 21:19:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982489811] [2023-08-26 21:19:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982489811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391371353] [2023-08-26 21:19:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:02,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:02,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:02,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:02,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-08-26 21:19:02,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:02,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:02,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-08-26 21:19:02,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:03,448 INFO L124 PetriNetUnfolderBase]: 7617/10421 cut-off events. [2023-08-26 21:19:03,448 INFO L125 PetriNetUnfolderBase]: For 2770/2770 co-relation queries the response was YES. [2023-08-26 21:19:03,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24703 conditions, 10421 events. 7617/10421 cut-off events. For 2770/2770 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54715 event pairs, 2336 based on Foata normal form. 0/9617 useless extension candidates. Maximal degree in co-relation 24691. Up to 4050 conditions per place. [2023-08-26 21:19:03,496 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 70 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-26 21:19:03,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 384 flow [2023-08-26 21:19:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-26 21:19:03,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123574144486692 [2023-08-26 21:19:03,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-26 21:19:03,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-26 21:19:03,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:03,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-26 21:19:03,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,501 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,501 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 120 flow. Second operand 4 states and 539 transitions. [2023-08-26 21:19:03,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 384 flow [2023-08-26 21:19:03,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:03,504 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 172 flow [2023-08-26 21:19:03,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=114, 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=172, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 21:19:03,505 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:19:03,505 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 172 flow [2023-08-26 21:19:03,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:03,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:03,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:19:03,506 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-26 21:19:03,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash -982016518, now seen corresponding path program 1 times [2023-08-26 21:19:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:03,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361414494] [2023-08-26 21:19:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:03,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361414494] [2023-08-26 21:19:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361414494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520495451] [2023-08-26 21:19:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:03,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:03,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-26 21:19:03,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:03,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-26 21:19:03,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:06,640 INFO L124 PetriNetUnfolderBase]: 34518/46806 cut-off events. [2023-08-26 21:19:06,640 INFO L125 PetriNetUnfolderBase]: For 32573/32573 co-relation queries the response was YES. [2023-08-26 21:19:06,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122933 conditions, 46806 events. 34518/46806 cut-off events. For 32573/32573 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 268118 event pairs, 9019 based on Foata normal form. 0/44266 useless extension candidates. Maximal degree in co-relation 122920. Up to 21067 conditions per place. [2023-08-26 21:19:06,840 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 124 selfloop transitions, 16 changer transitions 0/140 dead transitions. [2023-08-26 21:19:06,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 140 transitions, 880 flow [2023-08-26 21:19:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-26 21:19:06,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866920152091255 [2023-08-26 21:19:06,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-26 21:19:06,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-26 21:19:06,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:06,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-26 21:19:06,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:06,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:06,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:06,850 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 172 flow. Second operand 5 states and 640 transitions. [2023-08-26 21:19:06,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 140 transitions, 880 flow [2023-08-26 21:19:06,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 140 transitions, 814 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:06,878 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 282 flow [2023-08-26 21:19:06,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=154, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-26 21:19:06,880 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-26 21:19:06,880 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 282 flow [2023-08-26 21:19:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:06,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:06,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:06,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:19:06,881 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-26 21:19:06,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -377794065, now seen corresponding path program 1 times [2023-08-26 21:19:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127912150] [2023-08-26 21:19:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127912150] [2023-08-26 21:19:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127912150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803110305] [2023-08-26 21:19:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:07,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:07,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:07,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-26 21:19:07,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:07,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:07,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-26 21:19:07,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:11,144 INFO L124 PetriNetUnfolderBase]: 38236/52158 cut-off events. [2023-08-26 21:19:11,144 INFO L125 PetriNetUnfolderBase]: For 53468/53468 co-relation queries the response was YES. [2023-08-26 21:19:11,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164381 conditions, 52158 events. 38236/52158 cut-off events. For 53468/53468 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 303434 event pairs, 5207 based on Foata normal form. 1456/52298 useless extension candidates. Maximal degree in co-relation 164364. Up to 14026 conditions per place. [2023-08-26 21:19:11,399 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 178 selfloop transitions, 24 changer transitions 0/202 dead transitions. [2023-08-26 21:19:11,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 202 transitions, 1392 flow [2023-08-26 21:19:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-08-26 21:19:11,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47745790331341664 [2023-08-26 21:19:11,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-08-26 21:19:11,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-08-26 21:19:11,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:11,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-08-26 21:19:11,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,406 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,406 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 282 flow. Second operand 7 states and 879 transitions. [2023-08-26 21:19:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 202 transitions, 1392 flow [2023-08-26 21:19:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 202 transitions, 1392 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:19:11,427 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 510 flow [2023-08-26 21:19:11,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2023-08-26 21:19:11,428 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2023-08-26 21:19:11,428 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 510 flow [2023-08-26 21:19:11,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:11,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:19:11,429 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-26 21:19:11,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1121059143, now seen corresponding path program 1 times [2023-08-26 21:19:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417155203] [2023-08-26 21:19:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417155203] [2023-08-26 21:19:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417155203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:11,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673036279] [2023-08-26 21:19:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:11,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-26 21:19:11,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:11,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-26 21:19:11,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:17,113 INFO L124 PetriNetUnfolderBase]: 48150/66120 cut-off events. [2023-08-26 21:19:17,113 INFO L125 PetriNetUnfolderBase]: For 140115/140115 co-relation queries the response was YES. [2023-08-26 21:19:17,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231984 conditions, 66120 events. 48150/66120 cut-off events. For 140115/140115 co-relation queries the response was YES. Maximal size of possible extension queue 2088. Compared 407742 event pairs, 7477 based on Foata normal form. 1015/65319 useless extension candidates. Maximal degree in co-relation 231959. Up to 22354 conditions per place. [2023-08-26 21:19:17,434 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 173 selfloop transitions, 68 changer transitions 0/241 dead transitions. [2023-08-26 21:19:17,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 241 transitions, 2006 flow [2023-08-26 21:19:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-08-26 21:19:17,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48180336773492666 [2023-08-26 21:19:17,437 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-08-26 21:19:17,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-08-26 21:19:17,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:17,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-08-26 21:19:17,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:17,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:17,440 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:17,441 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 510 flow. Second operand 7 states and 887 transitions. [2023-08-26 21:19:17,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 241 transitions, 2006 flow [2023-08-26 21:19:18,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 241 transitions, 2006 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:19:18,300 INFO L231 Difference]: Finished difference. Result has 80 places, 124 transitions, 1296 flow [2023-08-26 21:19:18,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1296, PETRI_PLACES=80, PETRI_TRANSITIONS=124} [2023-08-26 21:19:18,301 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-26 21:19:18,301 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 124 transitions, 1296 flow [2023-08-26 21:19:18,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:18,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:18,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:19:18,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:18,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2010981586, now seen corresponding path program 1 times [2023-08-26 21:19:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891205753] [2023-08-26 21:19:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891205753] [2023-08-26 21:19:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891205753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12487863] [2023-08-26 21:19:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:18,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-08-26 21:19:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 124 transitions, 1296 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-08-26 21:19:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:21,385 INFO L124 PetriNetUnfolderBase]: 21065/31701 cut-off events. [2023-08-26 21:19:21,385 INFO L125 PetriNetUnfolderBase]: For 101452/103395 co-relation queries the response was YES. [2023-08-26 21:19:21,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114732 conditions, 31701 events. 21065/31701 cut-off events. For 101452/103395 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 221321 event pairs, 5536 based on Foata normal form. 1883/31399 useless extension candidates. Maximal degree in co-relation 114699. Up to 24974 conditions per place. [2023-08-26 21:19:21,554 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 155 selfloop transitions, 10 changer transitions 0/201 dead transitions. [2023-08-26 21:19:21,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 201 transitions, 2170 flow [2023-08-26 21:19:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-26 21:19:21,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49125475285171105 [2023-08-26 21:19:21,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-26 21:19:21,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-26 21:19:21,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:21,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-26 21:19:21,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:21,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:21,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:21,559 INFO L175 Difference]: Start difference. First operand has 80 places, 124 transitions, 1296 flow. Second operand 5 states and 646 transitions. [2023-08-26 21:19:21,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 201 transitions, 2170 flow [2023-08-26 21:19:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 201 transitions, 2162 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 21:19:22,076 INFO L231 Difference]: Finished difference. Result has 87 places, 120 transitions, 1251 flow [2023-08-26 21:19:22,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1251, PETRI_PLACES=87, PETRI_TRANSITIONS=120} [2023-08-26 21:19:22,077 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-26 21:19:22,077 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 120 transitions, 1251 flow [2023-08-26 21:19:22,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:22,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:22,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:19:22,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:22,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1516453149, now seen corresponding path program 1 times [2023-08-26 21:19:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:22,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848372713] [2023-08-26 21:19:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848372713] [2023-08-26 21:19:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848372713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686699813] [2023-08-26 21:19:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:22,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-08-26 21:19:22,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 120 transitions, 1251 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:22,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:22,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-08-26 21:19:22,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:25,043 INFO L124 PetriNetUnfolderBase]: 18848/28019 cut-off events. [2023-08-26 21:19:25,043 INFO L125 PetriNetUnfolderBase]: For 98582/100302 co-relation queries the response was YES. [2023-08-26 21:19:25,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105923 conditions, 28019 events. 18848/28019 cut-off events. For 98582/100302 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 191560 event pairs, 2724 based on Foata normal form. 544/27970 useless extension candidates. Maximal degree in co-relation 105885. Up to 13192 conditions per place. [2023-08-26 21:19:25,184 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 184 selfloop transitions, 17 changer transitions 0/237 dead transitions. [2023-08-26 21:19:25,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 237 transitions, 2711 flow [2023-08-26 21:19:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-26 21:19:25,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095057034220533 [2023-08-26 21:19:25,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-26 21:19:25,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-26 21:19:25,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:25,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-26 21:19:25,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,195 INFO L175 Difference]: Start difference. First operand has 87 places, 120 transitions, 1251 flow. Second operand 5 states and 670 transitions. [2023-08-26 21:19:25,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 237 transitions, 2711 flow [2023-08-26 21:19:25,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 237 transitions, 2697 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:25,614 INFO L231 Difference]: Finished difference. Result has 90 places, 124 transitions, 1319 flow [2023-08-26 21:19:25,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1319, PETRI_PLACES=90, PETRI_TRANSITIONS=124} [2023-08-26 21:19:25,615 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2023-08-26 21:19:25,615 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 124 transitions, 1319 flow [2023-08-26 21:19:25,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:25,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:25,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:19:25,615 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:25,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1079552221, now seen corresponding path program 1 times [2023-08-26 21:19:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:25,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561667838] [2023-08-26 21:19:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561667838] [2023-08-26 21:19:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561667838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201588830] [2023-08-26 21:19:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:25,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:25,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-26 21:19:25,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 124 transitions, 1319 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:25,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-26 21:19:25,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:30,862 INFO L124 PetriNetUnfolderBase]: 36298/52644 cut-off events. [2023-08-26 21:19:30,862 INFO L125 PetriNetUnfolderBase]: For 240916/240916 co-relation queries the response was YES. [2023-08-26 21:19:31,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218317 conditions, 52644 events. 36298/52644 cut-off events. For 240916/240916 co-relation queries the response was YES. Maximal size of possible extension queue 1899. Compared 358549 event pairs, 7588 based on Foata normal form. 544/52902 useless extension candidates. Maximal degree in co-relation 218278. Up to 17094 conditions per place. [2023-08-26 21:19:31,195 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 239 selfloop transitions, 83 changer transitions 12/334 dead transitions. [2023-08-26 21:19:31,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 334 transitions, 3715 flow [2023-08-26 21:19:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-08-26 21:19:31,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48940793047256925 [2023-08-26 21:19:31,200 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-08-26 21:19:31,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-08-26 21:19:31,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:31,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-08-26 21:19:31,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,204 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,204 INFO L175 Difference]: Start difference. First operand has 90 places, 124 transitions, 1319 flow. Second operand 7 states and 901 transitions. [2023-08-26 21:19:31,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 334 transitions, 3715 flow [2023-08-26 21:19:33,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 334 transitions, 3521 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-26 21:19:33,964 INFO L231 Difference]: Finished difference. Result has 99 places, 162 transitions, 2175 flow [2023-08-26 21:19:33,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2175, PETRI_PLACES=99, PETRI_TRANSITIONS=162} [2023-08-26 21:19:33,965 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-26 21:19:33,965 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 162 transitions, 2175 flow [2023-08-26 21:19:33,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:33,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:33,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:33,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:19:33,966 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-26 21:19:33,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash 955327293, now seen corresponding path program 1 times [2023-08-26 21:19:33,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:33,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770492027] [2023-08-26 21:19:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770492027] [2023-08-26 21:19:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770492027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914959141] [2023-08-26 21:19:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:34,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:34,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-08-26 21:19:34,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 162 transitions, 2175 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:34,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:34,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-08-26 21:19:34,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:36,457 INFO L124 PetriNetUnfolderBase]: 13968/21741 cut-off events. [2023-08-26 21:19:36,457 INFO L125 PetriNetUnfolderBase]: For 105049/106953 co-relation queries the response was YES. [2023-08-26 21:19:36,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88773 conditions, 21741 events. 13968/21741 cut-off events. For 105049/106953 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 153638 event pairs, 2133 based on Foata normal form. 1417/22540 useless extension candidates. Maximal degree in co-relation 88728. Up to 8043 conditions per place. [2023-08-26 21:19:36,569 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 205 selfloop transitions, 19 changer transitions 4/265 dead transitions. [2023-08-26 21:19:36,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 265 transitions, 3395 flow [2023-08-26 21:19:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-26 21:19:36,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49049429657794674 [2023-08-26 21:19:36,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-26 21:19:36,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-26 21:19:36,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:36,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-26 21:19:36,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:36,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:36,581 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:36,581 INFO L175 Difference]: Start difference. First operand has 99 places, 162 transitions, 2175 flow. Second operand 7 states and 903 transitions. [2023-08-26 21:19:36,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 265 transitions, 3395 flow [2023-08-26 21:19:37,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 265 transitions, 3158 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:37,497 INFO L231 Difference]: Finished difference. Result has 106 places, 131 transitions, 1556 flow [2023-08-26 21:19:37,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1556, PETRI_PLACES=106, PETRI_TRANSITIONS=131} [2023-08-26 21:19:37,497 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2023-08-26 21:19:37,498 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 131 transitions, 1556 flow [2023-08-26 21:19:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:37,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:37,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:19:37,498 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-26 21:19:37,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -977775883, now seen corresponding path program 1 times [2023-08-26 21:19:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:37,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570155289] [2023-08-26 21:19:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570155289] [2023-08-26 21:19:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570155289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:19:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265599804] [2023-08-26 21:19:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:37,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-08-26 21:19:37,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 131 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:37,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-08-26 21:19:37,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:39,524 INFO L124 PetriNetUnfolderBase]: 10961/16695 cut-off events. [2023-08-26 21:19:39,524 INFO L125 PetriNetUnfolderBase]: For 79065/80679 co-relation queries the response was YES. [2023-08-26 21:19:39,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74685 conditions, 16695 events. 10961/16695 cut-off events. For 79065/80679 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 111617 event pairs, 1161 based on Foata normal form. 639/16838 useless extension candidates. Maximal degree in co-relation 74637. Up to 4048 conditions per place. [2023-08-26 21:19:39,625 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 222 selfloop transitions, 28 changer transitions 4/275 dead transitions. [2023-08-26 21:19:39,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 275 transitions, 3169 flow [2023-08-26 21:19:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:19:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:19:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1158 transitions. [2023-08-26 21:19:39,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892268694550063 [2023-08-26 21:19:39,628 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1158 transitions. [2023-08-26 21:19:39,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1158 transitions. [2023-08-26 21:19:39,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:39,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1158 transitions. [2023-08-26 21:19:39,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:39,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:39,632 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:39,632 INFO L175 Difference]: Start difference. First operand has 106 places, 131 transitions, 1556 flow. Second operand 9 states and 1158 transitions. [2023-08-26 21:19:39,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 275 transitions, 3169 flow [2023-08-26 21:19:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 275 transitions, 3104 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 21:19:41,287 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 1200 flow [2023-08-26 21:19:41,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1200, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2023-08-26 21:19:41,288 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2023-08-26 21:19:41,288 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 1200 flow [2023-08-26 21:19:41,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:41,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:41,288 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] [2023-08-26 21:19:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:19:41,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:41,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash -998599115, now seen corresponding path program 1 times [2023-08-26 21:19:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035513829] [2023-08-26 21:19:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:41,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035513829] [2023-08-26 21:19:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035513829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442587468] [2023-08-26 21:19:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:41,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:41,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-08-26 21:19:41,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 1200 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:41,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:41,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-08-26 21:19:41,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:42,886 INFO L124 PetriNetUnfolderBase]: 10953/16611 cut-off events. [2023-08-26 21:19:42,886 INFO L125 PetriNetUnfolderBase]: For 83657/85050 co-relation queries the response was YES. [2023-08-26 21:19:42,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77766 conditions, 16611 events. 10953/16611 cut-off events. For 83657/85050 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 109741 event pairs, 2286 based on Foata normal form. 224/16469 useless extension candidates. Maximal degree in co-relation 77715. Up to 6702 conditions per place. [2023-08-26 21:19:42,973 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 113 selfloop transitions, 27 changer transitions 28/186 dead transitions. [2023-08-26 21:19:42,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 186 transitions, 2204 flow [2023-08-26 21:19:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:19:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:19:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2023-08-26 21:19:42,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923954372623574 [2023-08-26 21:19:42,974 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2023-08-26 21:19:42,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2023-08-26 21:19:42,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:42,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2023-08-26 21:19:42,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:42,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:42,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:42,978 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 1200 flow. Second operand 6 states and 777 transitions. [2023-08-26 21:19:42,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 186 transitions, 2204 flow [2023-08-26 21:19:45,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 186 transitions, 2144 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-26 21:19:45,239 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 885 flow [2023-08-26 21:19:45,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=885, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2023-08-26 21:19:45,240 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 53 predicate places. [2023-08-26 21:19:45,240 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 885 flow [2023-08-26 21:19:45,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:45,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:45,241 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] [2023-08-26 21:19:45,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:19:45,241 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-26 21:19:45,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1213622463, now seen corresponding path program 1 times [2023-08-26 21:19:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792266376] [2023-08-26 21:19:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792266376] [2023-08-26 21:19:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792266376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:19:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849135407] [2023-08-26 21:19:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:19:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:19:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:19:45,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 263 [2023-08-26 21:19:45,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 885 flow. Second operand has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:45,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:45,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 263 [2023-08-26 21:19:45,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:48,564 INFO L124 PetriNetUnfolderBase]: 16130/25295 cut-off events. [2023-08-26 21:19:48,565 INFO L125 PetriNetUnfolderBase]: For 141600/142541 co-relation queries the response was YES. [2023-08-26 21:19:48,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119879 conditions, 25295 events. 16130/25295 cut-off events. For 141600/142541 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 190105 event pairs, 2565 based on Foata normal form. 260/25241 useless extension candidates. Maximal degree in co-relation 119829. Up to 9288 conditions per place. [2023-08-26 21:19:48,741 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 158 selfloop transitions, 7 changer transitions 93/276 dead transitions. [2023-08-26 21:19:48,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 276 transitions, 3139 flow [2023-08-26 21:19:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:19:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:19:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 969 transitions. [2023-08-26 21:19:48,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605513307984791 [2023-08-26 21:19:48,743 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 969 transitions. [2023-08-26 21:19:48,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 969 transitions. [2023-08-26 21:19:48,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:48,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 969 transitions. [2023-08-26 21:19:48,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,747 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,747 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 885 flow. Second operand 8 states and 969 transitions. [2023-08-26 21:19:48,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 276 transitions, 3139 flow [2023-08-26 21:19:52,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 276 transitions, 2574 flow, removed 90 selfloop flow, removed 10 redundant places. [2023-08-26 21:19:52,608 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 826 flow [2023-08-26 21:19:52,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=826, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2023-08-26 21:19:52,609 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2023-08-26 21:19:52,609 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 826 flow [2023-08-26 21:19:52,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:52,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:52,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] [2023-08-26 21:19:52,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:19:52,610 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-26 21:19:52,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1005466651, now seen corresponding path program 2 times [2023-08-26 21:19:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717964635] [2023-08-26 21:19:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717964635] [2023-08-26 21:19:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717964635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:52,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:52,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:19:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458760850] [2023-08-26 21:19:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:52,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:19:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:19:52,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:19:52,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-08-26 21:19:52,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 826 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:52,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:52,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-08-26 21:19:52,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:55,192 INFO L124 PetriNetUnfolderBase]: 12893/19933 cut-off events. [2023-08-26 21:19:55,192 INFO L125 PetriNetUnfolderBase]: For 79306/81223 co-relation queries the response was YES. [2023-08-26 21:19:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87718 conditions, 19933 events. 12893/19933 cut-off events. For 79306/81223 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 143425 event pairs, 1004 based on Foata normal form. 352/19871 useless extension candidates. Maximal degree in co-relation 87680. Up to 4759 conditions per place. [2023-08-26 21:19:55,262 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 171 selfloop transitions, 29 changer transitions 55/268 dead transitions. [2023-08-26 21:19:55,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 268 transitions, 2896 flow [2023-08-26 21:19:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:19:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:19:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1373 transitions. [2023-08-26 21:19:55,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47459384721742137 [2023-08-26 21:19:55,265 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1373 transitions. [2023-08-26 21:19:55,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1373 transitions. [2023-08-26 21:19:55,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:55,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1373 transitions. [2023-08-26 21:19:55,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.81818181818181) internal successors, (1373), 11 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 263.0) internal successors, (3156), 12 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,270 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 263.0) internal successors, (3156), 12 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,270 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 826 flow. Second operand 11 states and 1373 transitions. [2023-08-26 21:19:55,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 268 transitions, 2896 flow [2023-08-26 21:19:57,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 268 transitions, 2800 flow, removed 33 selfloop flow, removed 11 redundant places. [2023-08-26 21:19:57,110 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 721 flow [2023-08-26 21:19:57,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=721, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2023-08-26 21:19:57,110 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-26 21:19:57,111 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 721 flow [2023-08-26 21:19:57,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:57,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:57,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, 1, 1, 1, 1, 1] [2023-08-26 21:19:57,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:19:57,111 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-26 21:19:57,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1932337468, now seen corresponding path program 1 times [2023-08-26 21:19:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214185828] [2023-08-26 21:19:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214185828] [2023-08-26 21:19:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214185828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:19:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485292530] [2023-08-26 21:19:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:57,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:57,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 263 [2023-08-26 21:19:57,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 721 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:57,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:57,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 263 [2023-08-26 21:19:57,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:58,397 INFO L124 PetriNetUnfolderBase]: 8059/12299 cut-off events. [2023-08-26 21:19:58,397 INFO L125 PetriNetUnfolderBase]: For 65032/65032 co-relation queries the response was YES. [2023-08-26 21:19:58,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60484 conditions, 12299 events. 8059/12299 cut-off events. For 65032/65032 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 76591 event pairs, 623 based on Foata normal form. 1/12300 useless extension candidates. Maximal degree in co-relation 60442. Up to 4605 conditions per place. [2023-08-26 21:19:58,441 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 73 selfloop transitions, 14 changer transitions 134/221 dead transitions. [2023-08-26 21:19:58,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 221 transitions, 2335 flow [2023-08-26 21:19:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-26 21:19:58,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492123845736013 [2023-08-26 21:19:58,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-26 21:19:58,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-26 21:19:58,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:58,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-26 21:19:58,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:58,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:58,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:58,447 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 721 flow. Second operand 7 states and 827 transitions. [2023-08-26 21:19:58,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 221 transitions, 2335 flow [2023-08-26 21:19:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 221 transitions, 2010 flow, removed 35 selfloop flow, removed 14 redundant places. [2023-08-26 21:19:58,796 INFO L231 Difference]: Finished difference. Result has 89 places, 54 transitions, 426 flow [2023-08-26 21:19:58,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=89, PETRI_TRANSITIONS=54} [2023-08-26 21:19:58,796 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-26 21:19:58,796 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 54 transitions, 426 flow [2023-08-26 21:19:58,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:58,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:58,797 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, 1] [2023-08-26 21:19:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:19:58,797 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-26 21:19:58,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2051210126, now seen corresponding path program 2 times [2023-08-26 21:19:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401548936] [2023-08-26 21:19:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401548936] [2023-08-26 21:19:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401548936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:58,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379911344] [2023-08-26 21:19:58,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:58,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:58,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:58,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-26 21:19:58,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 54 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:58,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:58,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-26 21:19:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:59,228 INFO L124 PetriNetUnfolderBase]: 1563/2501 cut-off events. [2023-08-26 21:19:59,228 INFO L125 PetriNetUnfolderBase]: For 9225/9225 co-relation queries the response was YES. [2023-08-26 21:19:59,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10589 conditions, 2501 events. 1563/2501 cut-off events. For 9225/9225 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12044 event pairs, 368 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 10561. Up to 1220 conditions per place. [2023-08-26 21:19:59,236 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 61 selfloop transitions, 4 changer transitions 28/93 dead transitions. [2023-08-26 21:19:59,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 823 flow [2023-08-26 21:19:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-08-26 21:19:59,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479087452471483 [2023-08-26 21:19:59,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-08-26 21:19:59,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-08-26 21:19:59,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:59,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-08-26 21:19:59,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,240 INFO L175 Difference]: Start difference. First operand has 89 places, 54 transitions, 426 flow. Second operand 5 states and 589 transitions. [2023-08-26 21:19:59,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 823 flow [2023-08-26 21:19:59,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 739 flow, removed 18 selfloop flow, removed 13 redundant places. [2023-08-26 21:19:59,255 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 250 flow [2023-08-26 21:19:59,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2023-08-26 21:19:59,256 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-26 21:19:59,256 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 250 flow [2023-08-26 21:19:59,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:59,256 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, 1] [2023-08-26 21:19:59,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:19:59,256 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-26 21:19:59,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1252778908, now seen corresponding path program 3 times [2023-08-26 21:19:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290067225] [2023-08-26 21:19:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:59,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290067225] [2023-08-26 21:19:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290067225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:59,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:59,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:19:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547398472] [2023-08-26 21:19:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:59,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:19:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:19:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:19:59,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 263 [2023-08-26 21:19:59,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 43 transitions, 250 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 263 [2023-08-26 21:19:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:20:00,314 INFO L124 PetriNetUnfolderBase]: 754/1229 cut-off events. [2023-08-26 21:20:00,315 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2023-08-26 21:20:00,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 1229 events. 754/1229 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4956 event pairs, 90 based on Foata normal form. 1/1230 useless extension candidates. Maximal degree in co-relation 4768. Up to 545 conditions per place. [2023-08-26 21:20:00,318 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 62 selfloop transitions, 8 changer transitions 41/111 dead transitions. [2023-08-26 21:20:00,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 819 flow [2023-08-26 21:20:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:20:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:20:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2023-08-26 21:20:00,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979721166032953 [2023-08-26 21:20:00,319 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 942 transitions. [2023-08-26 21:20:00,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 942 transitions. [2023-08-26 21:20:00,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:20:00,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 942 transitions. [2023-08-26 21:20:00,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,323 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,323 INFO L175 Difference]: Start difference. First operand has 73 places, 43 transitions, 250 flow. Second operand 9 states and 942 transitions. [2023-08-26 21:20:00,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 819 flow [2023-08-26 21:20:00,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 726 flow, removed 13 selfloop flow, removed 15 redundant places. [2023-08-26 21:20:00,329 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 223 flow [2023-08-26 21:20:00,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-08-26 21:20:00,329 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 21:20:00,329 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 223 flow [2023-08-26 21:20:00,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:20:00,330 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, 1] [2023-08-26 21:20:00,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:20:00,330 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:20:00,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:20:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -315252102, now seen corresponding path program 4 times [2023-08-26 21:20:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:20:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353284262] [2023-08-26 21:20:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:20:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:20:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:20:00,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:20:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:20:00,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:20:00,414 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:20:00,414 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:20:00,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:20:00,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:20:00,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:20:00,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:20:00,417 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:00,420 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:20:00,421 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:20:00,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:20:00 BasicIcfg [2023-08-26 21:20:00,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:20:00,481 INFO L158 Benchmark]: Toolchain (without parser) took 67632.48ms. Allocated memory was 348.1MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 323.4MB in the beginning and 8.5GB in the end (delta: -8.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-26 21:20:00,481 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 348.1MB. Free memory was 326.3MB in the beginning and 326.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:20:00,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.02ms. Allocated memory is still 348.1MB. Free memory was 323.4MB in the beginning and 299.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:20:00,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.30ms. Allocated memory is still 348.1MB. Free memory was 299.3MB in the beginning and 296.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:20:00,482 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 348.1MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:20:00,482 INFO L158 Benchmark]: RCFGBuilder took 586.97ms. Allocated memory is still 348.1MB. Free memory was 294.6MB in the beginning and 252.1MB in the end (delta: 42.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-26 21:20:00,482 INFO L158 Benchmark]: TraceAbstraction took 66524.49ms. Allocated memory was 348.1MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 251.0MB in the beginning and 8.5GB in the end (delta: -8.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-08-26 21:20:00,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 348.1MB. Free memory was 326.3MB in the beginning and 326.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 442.02ms. Allocated memory is still 348.1MB. Free memory was 323.4MB in the beginning and 299.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.30ms. Allocated memory is still 348.1MB. Free memory was 299.3MB in the beginning and 296.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 348.1MB. Free memory was 296.7MB in the beginning and 294.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 586.97ms. Allocated memory is still 348.1MB. Free memory was 294.6MB in the beginning and 252.1MB in the end (delta: 42.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 66524.49ms. Allocated memory was 348.1MB in the beginning and 10.7GB in the end (delta: 10.4GB). Free memory was 251.0MB in the beginning and 8.5GB in the end (delta: -8.3GB). Peak memory consumption was 2.1GB. 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.2s, 150 PlacesBefore, 52 PlacesAfterwards, 140 TransitionsBefore, 40 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 17292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5967, independent: 5599, independent conditional: 0, independent unconditional: 5599, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2505, independent: 2437, independent conditional: 0, independent unconditional: 2437, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5967, independent: 3162, independent conditional: 0, independent unconditional: 3162, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 2505, unknown conditional: 0, unknown unconditional: 2505] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 228, Positive conditional cache size: 0, Positive unconditional cache size: 228, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1161, ((void *)0), P0, ((void *)0))=-3, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1162, ((void *)0), P1, ((void *)0))=-2, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1163, ((void *)0), P2, ((void *)0))=-1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1164, ((void *)0), P3, ((void *)0))=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L775] EXPR 1 __unbuffered_cnt + 1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] EXPR 2 __unbuffered_cnt + 1 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L815] EXPR 3 __unbuffered_cnt + 1 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] EXPR 4 __unbuffered_cnt + 1 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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", "mix044_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 189 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: 66.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 59.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1188 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1188 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3117 IncrementalHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 48 mSDtfsCounter, 3117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2175occurred in iteration=10, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 2092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:20:00,499 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...