/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/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:29:04,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:29:05,071 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:29:05,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:29:05,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:29:05,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:29:05,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:29:05,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:29:05,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:29:05,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:29:05,114 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:29:05,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:29:05,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:29:05,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:29:05,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:29:05,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:29:05,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:29:05,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:29:05,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:29:05,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:29:05,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:29:05,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:29:05,118 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:29:05,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:29:05,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:29:05,119 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:29:05,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:29:05,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:29:05,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:29:05,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:29:05,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:29:05,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:29:05,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:29:05,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:29:05,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:29:05,122 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:29:05,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:29:05,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:29:05,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:29:05,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:29:05,478 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:29:05,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-08-26 21:29:06,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:29:06,965 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:29:06,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-08-26 21:29:06,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feea8df4e/de46c727f3794f7eb0a402c354e022d8/FLAGfc4f5a9a7 [2023-08-26 21:29:06,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feea8df4e/de46c727f3794f7eb0a402c354e022d8 [2023-08-26 21:29:06,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:29:06,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:29:06,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:29:06,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:29:07,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:29:07,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:29:06" (1/1) ... [2023-08-26 21:29:07,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cab66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07, skipping insertion in model container [2023-08-26 21:29:07,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:29:06" (1/1) ... [2023-08-26 21:29:07,061 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:29:07,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:29:07,448 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:29:07,476 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:29:07,478 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:29:07,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:29:07,586 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:29:07,587 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:29:07,593 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:29:07,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07 WrapperNode [2023-08-26 21:29:07,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:29:07,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:29:07,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:29:07,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:29:07,601 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:29:07" (1/1) ... [2023-08-26 21:29:07,633 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:29:07" (1/1) ... [2023-08-26 21:29:07,657 INFO L138 Inliner]: procedures = 177, calls = 89, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 203 [2023-08-26 21:29:07,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:29:07,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:29:07,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:29:07,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:29:07,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:29:07,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:29:07,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:29:07,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:29:07,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (1/1) ... [2023-08-26 21:29:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:29:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:29:07,766 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:29:07,777 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:29:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:29:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:29:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:29:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:29:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:29:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:29:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:29:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:29:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:29:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:29:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:29:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:29:07,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:29:07,805 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:29:07,955 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:29:07,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:29:08,405 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:29:08,760 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:29:08,760 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:29:08,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:29:08 BoogieIcfgContainer [2023-08-26 21:29:08,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:29:08,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:29:08,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:29:08,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:29:08,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:29:06" (1/3) ... [2023-08-26 21:29:08,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694ebfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:29:08, skipping insertion in model container [2023-08-26 21:29:08,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:29:07" (2/3) ... [2023-08-26 21:29:08,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694ebfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:29:08, skipping insertion in model container [2023-08-26 21:29:08,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:29:08" (3/3) ... [2023-08-26 21:29:08,772 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2023-08-26 21:29:08,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:29:08,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:29:08,792 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:29:08,890 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:29:08,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 158 transitions, 336 flow [2023-08-26 21:29:09,023 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2023-08-26 21:29:09,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:09,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 154 events. 3/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 21:29:09,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 158 transitions, 336 flow [2023-08-26 21:29:09,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 154 transitions, 320 flow [2023-08-26 21:29:09,041 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:29:09,058 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 154 transitions, 320 flow [2023-08-26 21:29:09,061 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 154 transitions, 320 flow [2023-08-26 21:29:09,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 154 transitions, 320 flow [2023-08-26 21:29:09,104 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2023-08-26 21:29:09,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:09,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 154 events. 3/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 21:29:09,109 INFO L119 LiptonReduction]: Number of co-enabled transitions 3960 [2023-08-26 21:29:17,507 INFO L134 LiptonReduction]: Checked pairs total: 13379 [2023-08-26 21:29:17,507 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-26 21:29:17,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:29:17,527 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;@7d44b059, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:29:17,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:29:17,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:29:17,530 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:29:17,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:29:17,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:17,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:29:17,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:17,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1001664094, now seen corresponding path program 1 times [2023-08-26 21:29:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491024404] [2023-08-26 21:29:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:17,884 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:29:17,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491024404] [2023-08-26 21:29:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491024404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540866882] [2023-08-26 21:29:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:17,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:17,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:17,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-26 21:29:17,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:29:17,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:17,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-26 21:29:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:20,373 INFO L124 PetriNetUnfolderBase]: 10064/14388 cut-off events. [2023-08-26 21:29:20,373 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2023-08-26 21:29:20,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28206 conditions, 14388 events. 10064/14388 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 84123 event pairs, 2687 based on Foata normal form. 0/11086 useless extension candidates. Maximal degree in co-relation 28194. Up to 11333 conditions per place. [2023-08-26 21:29:20,483 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 46 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-26 21:29:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 220 flow [2023-08-26 21:29:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 21:29:20,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994388327721661 [2023-08-26 21:29:20,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 21:29:20,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 21:29:20,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:20,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 21:29:20,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have 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:29:20,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:20,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:20,518 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 80 flow. Second operand 3 states and 445 transitions. [2023-08-26 21:29:20,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 220 flow [2023-08-26 21:29:20,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:29:20,525 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 78 flow [2023-08-26 21:29:20,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-26 21:29:20,531 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-26 21:29:20,531 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2023-08-26 21:29:20,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:29:20,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:20,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:29:20,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:29:20,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:20,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1001610103, now seen corresponding path program 1 times [2023-08-26 21:29:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775095490] [2023-08-26 21:29:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:20,649 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:29:20,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775095490] [2023-08-26 21:29:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775095490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342876911] [2023-08-26 21:29:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:20,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 297 [2023-08-26 21:29:20,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:29:20,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:20,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 297 [2023-08-26 21:29:20,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:22,677 INFO L124 PetriNetUnfolderBase]: 10523/14586 cut-off events. [2023-08-26 21:29:22,677 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2023-08-26 21:29:22,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30082 conditions, 14586 events. 10523/14586 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 78587 event pairs, 2964 based on Foata normal form. 0/10043 useless extension candidates. Maximal degree in co-relation 30072. Up to 12949 conditions per place. [2023-08-26 21:29:22,743 INFO L140 encePairwiseOnDemand]: 284/297 looper letters, 49 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-26 21:29:22,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 238 flow [2023-08-26 21:29:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 21:29:22,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49719416386083054 [2023-08-26 21:29:22,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 21:29:22,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 21:29:22,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:22,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 21:29:22,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:29:22,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:22,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:22,750 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 3 states and 443 transitions. [2023-08-26 21:29:22,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 238 flow [2023-08-26 21:29:22,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:22,752 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 121 flow [2023-08-26 21:29:22,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-26 21:29:22,753 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-08-26 21:29:22,753 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 121 flow [2023-08-26 21:29:22,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:29:22,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:22,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:22,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:29:22,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:22,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1482996099, now seen corresponding path program 1 times [2023-08-26 21:29:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919365762] [2023-08-26 21:29:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:22,871 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:29:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919365762] [2023-08-26 21:29:22,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919365762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251706458] [2023-08-26 21:29:22,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:22,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:22,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 297 [2023-08-26 21:29:22,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:29:22,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:22,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 297 [2023-08-26 21:29:22,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:24,217 INFO L124 PetriNetUnfolderBase]: 6487/8976 cut-off events. [2023-08-26 21:29:24,217 INFO L125 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2023-08-26 21:29:24,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21933 conditions, 8976 events. 6487/8976 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 44929 event pairs, 1720 based on Foata normal form. 0/7237 useless extension candidates. Maximal degree in co-relation 21922. Up to 7338 conditions per place. [2023-08-26 21:29:24,257 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 45 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-26 21:29:24,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 247 flow [2023-08-26 21:29:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-26 21:29:24,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730639730639731 [2023-08-26 21:29:24,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-26 21:29:24,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-26 21:29:24,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:24,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-26 21:29:24,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have 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:29:24,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:24,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:24,265 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 121 flow. Second operand 4 states and 562 transitions. [2023-08-26 21:29:24,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 247 flow [2023-08-26 21:29:24,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:29:24,269 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 110 flow [2023-08-26 21:29:24,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-26 21:29:24,270 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-08-26 21:29:24,270 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 110 flow [2023-08-26 21:29:24,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:29:24,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:24,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:24,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:29:24,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:24,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1482996100, now seen corresponding path program 1 times [2023-08-26 21:29:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897083212] [2023-08-26 21:29:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:24,384 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:29:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897083212] [2023-08-26 21:29:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897083212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703117466] [2023-08-26 21:29:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:24,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:24,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 297 [2023-08-26 21:29:24,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:29:24,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:24,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 297 [2023-08-26 21:29:24,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:25,180 INFO L124 PetriNetUnfolderBase]: 4327/6030 cut-off events. [2023-08-26 21:29:25,180 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2023-08-26 21:29:25,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14552 conditions, 6030 events. 4327/6030 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28562 event pairs, 1191 based on Foata normal form. 0/5451 useless extension candidates. Maximal degree in co-relation 14540. Up to 2268 conditions per place. [2023-08-26 21:29:25,204 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 61 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-26 21:29:25,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 344 flow [2023-08-26 21:29:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2023-08-26 21:29:25,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-26 21:29:25,207 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2023-08-26 21:29:25,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2023-08-26 21:29:25,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:25,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2023-08-26 21:29:25,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:25,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:25,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:25,211 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 110 flow. Second operand 4 states and 582 transitions. [2023-08-26 21:29:25,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 344 flow [2023-08-26 21:29:25,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:25,215 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 162 flow [2023-08-26 21:29:25,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-26 21:29:25,216 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-08-26 21:29:25,216 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 162 flow [2023-08-26 21:29:25,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:29:25,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:25,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:25,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:29:25,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:25,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 605756829, now seen corresponding path program 1 times [2023-08-26 21:29:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92209110] [2023-08-26 21:29:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:25,373 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:29:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92209110] [2023-08-26 21:29:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92209110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673271865] [2023-08-26 21:29:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:25,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:25,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 297 [2023-08-26 21:29:25,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have 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:29:25,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:25,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 297 [2023-08-26 21:29:25,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:26,152 INFO L124 PetriNetUnfolderBase]: 4113/5739 cut-off events. [2023-08-26 21:29:26,153 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2023-08-26 21:29:26,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16134 conditions, 5739 events. 4113/5739 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 27933 event pairs, 833 based on Foata normal form. 0/5237 useless extension candidates. Maximal degree in co-relation 16121. Up to 4845 conditions per place. [2023-08-26 21:29:26,175 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 61 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-26 21:29:26,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 405 flow [2023-08-26 21:29:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 21:29:26,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49719416386083054 [2023-08-26 21:29:26,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 21:29:26,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 21:29:26,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:26,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 21:29:26,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:29:26,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:26,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:26,187 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 162 flow. Second operand 3 states and 443 transitions. [2023-08-26 21:29:26,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 405 flow [2023-08-26 21:29:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 375 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:26,196 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 152 flow [2023-08-26 21:29:26,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-26 21:29:26,198 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-26 21:29:26,198 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 152 flow [2023-08-26 21:29:26,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have 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:29:26,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:26,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:26,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:29:26,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:26,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1598591565, now seen corresponding path program 1 times [2023-08-26 21:29:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:26,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067291695] [2023-08-26 21:29:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:29:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067291695] [2023-08-26 21:29:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067291695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:29:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725099300] [2023-08-26 21:29:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:26,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:26,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 297 [2023-08-26 21:29:26,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have 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:29:26,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:26,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 297 [2023-08-26 21:29:26,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:27,782 INFO L124 PetriNetUnfolderBase]: 7122/9920 cut-off events. [2023-08-26 21:29:27,782 INFO L125 PetriNetUnfolderBase]: For 4167/4167 co-relation queries the response was YES. [2023-08-26 21:29:27,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26915 conditions, 9920 events. 7122/9920 cut-off events. For 4167/4167 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 48662 event pairs, 1207 based on Foata normal form. 286/9735 useless extension candidates. Maximal degree in co-relation 26901. Up to 4150 conditions per place. [2023-08-26 21:29:27,833 INFO L140 encePairwiseOnDemand]: 293/297 looper letters, 82 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-26 21:29:27,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 526 flow [2023-08-26 21:29:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-26 21:29:27,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48569023569023567 [2023-08-26 21:29:27,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-26 21:29:27,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-26 21:29:27,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:27,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-26 21:29:27,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 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:29:27,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:27,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:27,840 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 152 flow. Second operand 4 states and 577 transitions. [2023-08-26 21:29:27,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 526 flow [2023-08-26 21:29:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:27,845 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 167 flow [2023-08-26 21:29:27,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:29:27,846 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2023-08-26 21:29:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 167 flow [2023-08-26 21:29:27,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have 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:29:27,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:27,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:27,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:29:27,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:27,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1983291129, now seen corresponding path program 1 times [2023-08-26 21:29:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27908033] [2023-08-26 21:29:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:28,073 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:29:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27908033] [2023-08-26 21:29:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27908033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:29:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811472463] [2023-08-26 21:29:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:28,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:29:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:29:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:29:28,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 297 [2023-08-26 21:29:28,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:28,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:28,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 297 [2023-08-26 21:29:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:29,213 INFO L124 PetriNetUnfolderBase]: 5590/8294 cut-off events. [2023-08-26 21:29:29,213 INFO L125 PetriNetUnfolderBase]: For 4872/4872 co-relation queries the response was YES. [2023-08-26 21:29:29,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23073 conditions, 8294 events. 5590/8294 cut-off events. For 4872/4872 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 46000 event pairs, 1002 based on Foata normal form. 39/7892 useless extension candidates. Maximal degree in co-relation 23057. Up to 6461 conditions per place. [2023-08-26 21:29:29,240 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 59 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-26 21:29:29,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 395 flow [2023-08-26 21:29:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:29:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:29:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-26 21:29:29,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49270482603815935 [2023-08-26 21:29:29,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-26 21:29:29,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-26 21:29:29,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:29,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-26 21:29:29,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:29:29,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:29,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have 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:29:29,246 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 167 flow. Second operand 3 states and 439 transitions. [2023-08-26 21:29:29,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 395 flow [2023-08-26 21:29:29,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:29,251 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 171 flow [2023-08-26 21:29:29,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=163, 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=171, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-26 21:29:29,251 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-26 21:29:29,252 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 171 flow [2023-08-26 21:29:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:29,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:29,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:29,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:29:29,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:29,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1426663333, now seen corresponding path program 1 times [2023-08-26 21:29:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456536847] [2023-08-26 21:29:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:30,840 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:29:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456536847] [2023-08-26 21:29:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456536847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:29:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734347787] [2023-08-26 21:29:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:30,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:29:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:29:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:29:30,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 297 [2023-08-26 21:29:30,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:30,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:30,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 297 [2023-08-26 21:29:30,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:32,403 INFO L124 PetriNetUnfolderBase]: 7475/10717 cut-off events. [2023-08-26 21:29:32,403 INFO L125 PetriNetUnfolderBase]: For 6999/6999 co-relation queries the response was YES. [2023-08-26 21:29:32,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30628 conditions, 10717 events. 7475/10717 cut-off events. For 6999/6999 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 59506 event pairs, 1591 based on Foata normal form. 60/10288 useless extension candidates. Maximal degree in co-relation 30611. Up to 7151 conditions per place. [2023-08-26 21:29:32,447 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 135 selfloop transitions, 16 changer transitions 0/152 dead transitions. [2023-08-26 21:29:32,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 152 transitions, 993 flow [2023-08-26 21:29:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:29:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:29:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-08-26 21:29:32,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2023-08-26 21:29:32,449 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-08-26 21:29:32,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-08-26 21:29:32,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:32,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-08-26 21:29:32,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have 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:29:32,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:32,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:32,455 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 171 flow. Second operand 7 states and 858 transitions. [2023-08-26 21:29:32,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 152 transitions, 993 flow [2023-08-26 21:29:32,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 152 transitions, 985 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:32,462 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 270 flow [2023-08-26 21:29:32,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-26 21:29:32,462 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2023-08-26 21:29:32,462 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 270 flow [2023-08-26 21:29:32,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:32,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:32,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:32,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:29:32,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:32,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 829054471, now seen corresponding path program 2 times [2023-08-26 21:29:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868362520] [2023-08-26 21:29:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:33,271 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:29:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868362520] [2023-08-26 21:29:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868362520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:29:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337697975] [2023-08-26 21:29:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:29:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:33,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:29:33,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:29:33,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 297 [2023-08-26 21:29:33,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:29:33,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:33,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 297 [2023-08-26 21:29:33,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:34,749 INFO L124 PetriNetUnfolderBase]: 7703/10888 cut-off events. [2023-08-26 21:29:34,749 INFO L125 PetriNetUnfolderBase]: For 12741/12823 co-relation queries the response was YES. [2023-08-26 21:29:34,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39120 conditions, 10888 events. 7703/10888 cut-off events. For 12741/12823 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 57888 event pairs, 2393 based on Foata normal form. 88/10487 useless extension candidates. Maximal degree in co-relation 39100. Up to 10149 conditions per place. [2023-08-26 21:29:34,807 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 85 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2023-08-26 21:29:34,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 114 transitions, 787 flow [2023-08-26 21:29:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:29:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:29:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-08-26 21:29:34,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4062850729517396 [2023-08-26 21:29:34,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-08-26 21:29:34,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-08-26 21:29:34,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:34,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-08-26 21:29:34,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:34,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:34,814 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:34,814 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 270 flow. Second operand 6 states and 724 transitions. [2023-08-26 21:29:34,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 114 transitions, 787 flow [2023-08-26 21:29:34,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 787 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:29:34,841 INFO L231 Difference]: Finished difference. Result has 66 places, 79 transitions, 522 flow [2023-08-26 21:29:34,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=66, PETRI_TRANSITIONS=79} [2023-08-26 21:29:34,841 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2023-08-26 21:29:34,842 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 79 transitions, 522 flow [2023-08-26 21:29:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:29:34,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:34,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:29:34,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:34,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1250525300, now seen corresponding path program 1 times [2023-08-26 21:29:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612964201] [2023-08-26 21:29:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:35,034 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:29:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612964201] [2023-08-26 21:29:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612964201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:35,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:35,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657916939] [2023-08-26 21:29:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:35,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:35,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 297 [2023-08-26 21:29:35,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 79 transitions, 522 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have 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:29:35,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:35,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 297 [2023-08-26 21:29:35,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:36,586 INFO L124 PetriNetUnfolderBase]: 6817/9943 cut-off events. [2023-08-26 21:29:36,586 INFO L125 PetriNetUnfolderBase]: For 20365/20393 co-relation queries the response was YES. [2023-08-26 21:29:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40845 conditions, 9943 events. 6817/9943 cut-off events. For 20365/20393 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 57082 event pairs, 699 based on Foata normal form. 669/10011 useless extension candidates. Maximal degree in co-relation 40819. Up to 5342 conditions per place. [2023-08-26 21:29:36,650 INFO L140 encePairwiseOnDemand]: 290/297 looper letters, 147 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2023-08-26 21:29:36,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 154 transitions, 1316 flow [2023-08-26 21:29:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-08-26 21:29:36,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47558922558922556 [2023-08-26 21:29:36,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-08-26 21:29:36,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-08-26 21:29:36,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:36,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-08-26 21:29:36,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have 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:29:36,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:36,656 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:36,657 INFO L175 Difference]: Start difference. First operand has 66 places, 79 transitions, 522 flow. Second operand 4 states and 565 transitions. [2023-08-26 21:29:36,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 154 transitions, 1316 flow [2023-08-26 21:29:36,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 154 transitions, 1306 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-26 21:29:36,689 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 535 flow [2023-08-26 21:29:36,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2023-08-26 21:29:36,690 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-08-26 21:29:36,690 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 535 flow [2023-08-26 21:29:36,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have 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:29:36,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:36,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:29:36,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:36,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1638441516, now seen corresponding path program 1 times [2023-08-26 21:29:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340818659] [2023-08-26 21:29:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:36,803 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:29:36,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:36,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340818659] [2023-08-26 21:29:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340818659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:36,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:36,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:36,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460764860] [2023-08-26 21:29:36,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:36,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:29:36,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:36,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:29:36,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:29:36,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 297 [2023-08-26 21:29:36,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:36,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:36,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 297 [2023-08-26 21:29:36,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:38,258 INFO L124 PetriNetUnfolderBase]: 6025/8662 cut-off events. [2023-08-26 21:29:38,258 INFO L125 PetriNetUnfolderBase]: For 22157/22185 co-relation queries the response was YES. [2023-08-26 21:29:38,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37879 conditions, 8662 events. 6025/8662 cut-off events. For 22157/22185 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 47437 event pairs, 655 based on Foata normal form. 10/8626 useless extension candidates. Maximal degree in co-relation 37849. Up to 3954 conditions per place. [2023-08-26 21:29:38,324 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 156 selfloop transitions, 13 changer transitions 0/170 dead transitions. [2023-08-26 21:29:38,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 170 transitions, 1471 flow [2023-08-26 21:29:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:29:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:29:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2023-08-26 21:29:38,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48754208754208755 [2023-08-26 21:29:38,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2023-08-26 21:29:38,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2023-08-26 21:29:38,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:38,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2023-08-26 21:29:38,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:38,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have 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:29:38,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have 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:29:38,331 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 535 flow. Second operand 5 states and 724 transitions. [2023-08-26 21:29:38,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 170 transitions, 1471 flow [2023-08-26 21:29:38,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 170 transitions, 1453 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:29:38,360 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 593 flow [2023-08-26 21:29:38,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2023-08-26 21:29:38,361 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2023-08-26 21:29:38,361 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 593 flow [2023-08-26 21:29:38,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:38,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:38,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:38,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:29:38,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:38,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1516170986, now seen corresponding path program 1 times [2023-08-26 21:29:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:38,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845607578] [2023-08-26 21:29:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:38,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:39,730 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:29:39,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845607578] [2023-08-26 21:29:39,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845607578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:39,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:39,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:29:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111631369] [2023-08-26 21:29:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:39,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:29:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:39,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:29:39,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:29:39,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 297 [2023-08-26 21:29:39,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 593 flow. Second operand has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have 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:29:39,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:39,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 297 [2023-08-26 21:29:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:41,453 INFO L124 PetriNetUnfolderBase]: 6881/10032 cut-off events. [2023-08-26 21:29:41,453 INFO L125 PetriNetUnfolderBase]: For 30065/30209 co-relation queries the response was YES. [2023-08-26 21:29:41,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45686 conditions, 10032 events. 6881/10032 cut-off events. For 30065/30209 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 57215 event pairs, 1725 based on Foata normal form. 180/10168 useless extension candidates. Maximal degree in co-relation 45656. Up to 6467 conditions per place. [2023-08-26 21:29:41,517 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 123 selfloop transitions, 43 changer transitions 0/167 dead transitions. [2023-08-26 21:29:41,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 167 transitions, 1499 flow [2023-08-26 21:29:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:29:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:29:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-26 21:29:41,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3995510662177329 [2023-08-26 21:29:41,519 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-26 21:29:41,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-26 21:29:41,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:41,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-26 21:29:41,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have 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:29:41,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:41,524 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:41,524 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 593 flow. Second operand 6 states and 712 transitions. [2023-08-26 21:29:41,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 167 transitions, 1499 flow [2023-08-26 21:29:41,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 167 transitions, 1393 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-26 21:29:41,653 INFO L231 Difference]: Finished difference. Result has 78 places, 104 transitions, 874 flow [2023-08-26 21:29:41,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=78, PETRI_TRANSITIONS=104} [2023-08-26 21:29:41,654 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2023-08-26 21:29:41,654 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 104 transitions, 874 flow [2023-08-26 21:29:41,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have 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:29:41,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:41,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:41,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:29:41,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:41,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 168875269, now seen corresponding path program 1 times [2023-08-26 21:29:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68255549] [2023-08-26 21:29:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:41,885 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:29:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68255549] [2023-08-26 21:29:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68255549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:29:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629415386] [2023-08-26 21:29:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:41,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:29:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:29:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:29:41,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 297 [2023-08-26 21:29:41,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 104 transitions, 874 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:41,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:41,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 297 [2023-08-26 21:29:41,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:43,067 INFO L124 PetriNetUnfolderBase]: 5142/7679 cut-off events. [2023-08-26 21:29:43,067 INFO L125 PetriNetUnfolderBase]: For 33265/33265 co-relation queries the response was YES. [2023-08-26 21:29:43,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39358 conditions, 7679 events. 5142/7679 cut-off events. For 33265/33265 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43988 event pairs, 714 based on Foata normal form. 440/8065 useless extension candidates. Maximal degree in co-relation 39325. Up to 2935 conditions per place. [2023-08-26 21:29:43,117 INFO L140 encePairwiseOnDemand]: 290/297 looper letters, 180 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2023-08-26 21:29:43,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 191 transitions, 1947 flow [2023-08-26 21:29:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:29:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:29:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2023-08-26 21:29:43,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47609427609427607 [2023-08-26 21:29:43,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2023-08-26 21:29:43,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2023-08-26 21:29:43,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:43,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2023-08-26 21:29:43,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:43,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have 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:29:43,124 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have 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:29:43,124 INFO L175 Difference]: Start difference. First operand has 78 places, 104 transitions, 874 flow. Second operand 5 states and 707 transitions. [2023-08-26 21:29:43,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 191 transitions, 1947 flow [2023-08-26 21:29:43,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 1884 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 21:29:43,251 INFO L231 Difference]: Finished difference. Result has 82 places, 89 transitions, 747 flow [2023-08-26 21:29:43,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2023-08-26 21:29:43,253 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2023-08-26 21:29:43,253 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 747 flow [2023-08-26 21:29:43,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:43,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:43,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:43,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:29:43,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:43,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1060735873, now seen corresponding path program 1 times [2023-08-26 21:29:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:43,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883915425] [2023-08-26 21:29:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:44,584 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:29:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883915425] [2023-08-26 21:29:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883915425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:29:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514111907] [2023-08-26 21:29:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:44,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:29:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:44,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:29:44,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:29:44,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 297 [2023-08-26 21:29:44,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 747 flow. Second operand has 8 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:44,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:44,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 297 [2023-08-26 21:29:44,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:46,628 INFO L124 PetriNetUnfolderBase]: 7734/11885 cut-off events. [2023-08-26 21:29:46,628 INFO L125 PetriNetUnfolderBase]: For 59254/59262 co-relation queries the response was YES. [2023-08-26 21:29:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62949 conditions, 11885 events. 7734/11885 cut-off events. For 59254/59262 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 77234 event pairs, 2389 based on Foata normal form. 5/11782 useless extension candidates. Maximal degree in co-relation 62913. Up to 5240 conditions per place. [2023-08-26 21:29:46,709 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 154 selfloop transitions, 40 changer transitions 0/195 dead transitions. [2023-08-26 21:29:46,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 195 transitions, 1980 flow [2023-08-26 21:29:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:29:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:29:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions. [2023-08-26 21:29:46,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290524290524291 [2023-08-26 21:29:46,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 892 transitions. [2023-08-26 21:29:46,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions. [2023-08-26 21:29:46,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:46,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions. [2023-08-26 21:29:46,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have 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:29:46,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:46,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:46,717 INFO L175 Difference]: Start difference. First operand has 82 places, 89 transitions, 747 flow. Second operand 7 states and 892 transitions. [2023-08-26 21:29:46,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 195 transitions, 1980 flow [2023-08-26 21:29:46,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 195 transitions, 1922 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:29:46,840 INFO L231 Difference]: Finished difference. Result has 88 places, 103 transitions, 984 flow [2023-08-26 21:29:46,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=984, PETRI_PLACES=88, PETRI_TRANSITIONS=103} [2023-08-26 21:29:46,841 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2023-08-26 21:29:46,841 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 103 transitions, 984 flow [2023-08-26 21:29:46,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:46,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:46,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:46,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:29:46,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:46,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:46,842 INFO L85 PathProgramCache]: Analyzing trace with hash 946466557, now seen corresponding path program 2 times [2023-08-26 21:29:46,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:46,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113681420] [2023-08-26 21:29:46,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:46,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:47,092 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:29:47,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:47,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113681420] [2023-08-26 21:29:47,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113681420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:47,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:29:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217622249] [2023-08-26 21:29:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:47,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:29:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:29:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:29:47,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 297 [2023-08-26 21:29:47,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 984 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have 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:29:47,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:47,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 297 [2023-08-26 21:29:47,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:48,745 INFO L124 PetriNetUnfolderBase]: 6717/10242 cut-off events. [2023-08-26 21:29:48,745 INFO L125 PetriNetUnfolderBase]: For 71302/71302 co-relation queries the response was YES. [2023-08-26 21:29:48,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60126 conditions, 10242 events. 6717/10242 cut-off events. For 71302/71302 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 64359 event pairs, 826 based on Foata normal form. 295/10408 useless extension candidates. Maximal degree in co-relation 60087. Up to 3958 conditions per place. [2023-08-26 21:29:48,811 INFO L140 encePairwiseOnDemand]: 290/297 looper letters, 223 selfloop transitions, 14 changer transitions 0/238 dead transitions. [2023-08-26 21:29:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 238 transitions, 2809 flow [2023-08-26 21:29:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:29:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:29:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2023-08-26 21:29:48,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2023-08-26 21:29:48,813 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 847 transitions. [2023-08-26 21:29:48,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions. [2023-08-26 21:29:48,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:48,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions. [2023-08-26 21:29:48,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have 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:29:48,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:48,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:48,818 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 984 flow. Second operand 6 states and 847 transitions. [2023-08-26 21:29:48,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 238 transitions, 2809 flow [2023-08-26 21:29:49,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 238 transitions, 2700 flow, removed 52 selfloop flow, removed 2 redundant places. [2023-08-26 21:29:49,065 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 942 flow [2023-08-26 21:29:49,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2023-08-26 21:29:49,066 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2023-08-26 21:29:49,066 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 942 flow [2023-08-26 21:29:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have 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:29:49,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:49,066 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:29:49,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:29:49,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:49,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 461517267, now seen corresponding path program 1 times [2023-08-26 21:29:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582100416] [2023-08-26 21:29:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:49,170 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:29:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582100416] [2023-08-26 21:29:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582100416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:49,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:29:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46841501] [2023-08-26 21:29:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:29:49,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:29:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:29:49,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 297 [2023-08-26 21:29:49,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:29:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:49,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 297 [2023-08-26 21:29:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:50,825 INFO L124 PetriNetUnfolderBase]: 6661/10066 cut-off events. [2023-08-26 21:29:50,826 INFO L125 PetriNetUnfolderBase]: For 76124/76124 co-relation queries the response was YES. [2023-08-26 21:29:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61945 conditions, 10066 events. 6661/10066 cut-off events. For 76124/76124 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 62693 event pairs, 815 based on Foata normal form. 0/10057 useless extension candidates. Maximal degree in co-relation 61903. Up to 3958 conditions per place. [2023-08-26 21:29:50,886 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 167 selfloop transitions, 17 changer transitions 28/213 dead transitions. [2023-08-26 21:29:50,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 213 transitions, 2496 flow [2023-08-26 21:29:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:29:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:29:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2023-08-26 21:29:50,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47418630751964086 [2023-08-26 21:29:50,888 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2023-08-26 21:29:50,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2023-08-26 21:29:50,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:50,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2023-08-26 21:29:50,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have 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:29:50,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:50,893 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have 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:29:50,893 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 942 flow. Second operand 6 states and 845 transitions. [2023-08-26 21:29:50,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 213 transitions, 2496 flow [2023-08-26 21:29:51,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 213 transitions, 2472 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:29:51,428 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 840 flow [2023-08-26 21:29:51,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=840, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2023-08-26 21:29:51,429 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-08-26 21:29:51,429 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 840 flow [2023-08-26 21:29:51,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have 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:29:51,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:51,430 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:29:51,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:29:51,430 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:51,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -639063128, now seen corresponding path program 1 times [2023-08-26 21:29:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696307657] [2023-08-26 21:29:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:52,316 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:29:52,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:52,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696307657] [2023-08-26 21:29:52,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696307657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:52,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:52,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:29:52,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229422028] [2023-08-26 21:29:52,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:52,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:29:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:29:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:29:52,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 297 [2023-08-26 21:29:52,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have 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:29:52,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:52,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 297 [2023-08-26 21:29:52,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:53,058 INFO L124 PetriNetUnfolderBase]: 1441/2354 cut-off events. [2023-08-26 21:29:53,058 INFO L125 PetriNetUnfolderBase]: For 17950/17952 co-relation queries the response was YES. [2023-08-26 21:29:53,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15217 conditions, 2354 events. 1441/2354 cut-off events. For 17950/17952 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12497 event pairs, 398 based on Foata normal form. 8/2361 useless extension candidates. Maximal degree in co-relation 15175. Up to 1359 conditions per place. [2023-08-26 21:29:53,080 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 97 selfloop transitions, 32 changer transitions 45/175 dead transitions. [2023-08-26 21:29:53,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 2132 flow [2023-08-26 21:29:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:29:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:29:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-08-26 21:29:53,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634439634439633 [2023-08-26 21:29:53,083 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-08-26 21:29:53,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-08-26 21:29:53,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:53,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-08-26 21:29:53,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have 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:29:53,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:53,089 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:53,089 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 840 flow. Second operand 7 states and 824 transitions. [2023-08-26 21:29:53,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 175 transitions, 2132 flow [2023-08-26 21:29:53,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 1477 flow, removed 100 selfloop flow, removed 21 redundant places. [2023-08-26 21:29:53,143 INFO L231 Difference]: Finished difference. Result has 76 places, 89 transitions, 844 flow [2023-08-26 21:29:53,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2023-08-26 21:29:53,144 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2023-08-26 21:29:53,144 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 89 transitions, 844 flow [2023-08-26 21:29:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have 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:29:53,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:53,145 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:29:53,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:29:53,145 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:53,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash 721423246, now seen corresponding path program 2 times [2023-08-26 21:29:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4287576] [2023-08-26 21:29:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:54,793 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:29:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4287576] [2023-08-26 21:29:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4287576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:54,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:54,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:29:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477783281] [2023-08-26 21:29:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:29:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:29:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:29:54,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 297 [2023-08-26 21:29:54,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 89 transitions, 844 flow. Second operand has 9 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:54,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:54,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 297 [2023-08-26 21:29:54,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:55,530 INFO L124 PetriNetUnfolderBase]: 1525/2519 cut-off events. [2023-08-26 21:29:55,531 INFO L125 PetriNetUnfolderBase]: For 11152/11167 co-relation queries the response was YES. [2023-08-26 21:29:55,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12760 conditions, 2519 events. 1525/2519 cut-off events. For 11152/11167 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13673 event pairs, 245 based on Foata normal form. 13/2531 useless extension candidates. Maximal degree in co-relation 12728. Up to 1257 conditions per place. [2023-08-26 21:29:55,544 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 144 selfloop transitions, 48 changer transitions 0/193 dead transitions. [2023-08-26 21:29:55,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 193 transitions, 1831 flow [2023-08-26 21:29:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:29:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:29:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 988 transitions. [2023-08-26 21:29:55,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158249158249158 [2023-08-26 21:29:55,547 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 988 transitions. [2023-08-26 21:29:55,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 988 transitions. [2023-08-26 21:29:55,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:55,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 988 transitions. [2023-08-26 21:29:55,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.5) internal successors, (988), 8 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:29:55,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have 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:29:55,551 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have 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:29:55,551 INFO L175 Difference]: Start difference. First operand has 76 places, 89 transitions, 844 flow. Second operand 8 states and 988 transitions. [2023-08-26 21:29:55,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 193 transitions, 1831 flow [2023-08-26 21:29:55,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 193 transitions, 1800 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-26 21:29:55,571 INFO L231 Difference]: Finished difference. Result has 82 places, 109 transitions, 1154 flow [2023-08-26 21:29:55,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1154, PETRI_PLACES=82, PETRI_TRANSITIONS=109} [2023-08-26 21:29:55,572 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2023-08-26 21:29:55,572 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 1154 flow [2023-08-26 21:29:55,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:55,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:55,572 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:29:55,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:29:55,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:55,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 25662746, now seen corresponding path program 3 times [2023-08-26 21:29:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590986164] [2023-08-26 21:29:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:55,854 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:29:55,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:55,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590986164] [2023-08-26 21:29:55,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590986164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:55,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:29:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71215272] [2023-08-26 21:29:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:55,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:29:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:29:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:29:55,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 297 [2023-08-26 21:29:55,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 1154 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:29:55,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:55,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 297 [2023-08-26 21:29:55,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:56,428 INFO L124 PetriNetUnfolderBase]: 1457/2366 cut-off events. [2023-08-26 21:29:56,428 INFO L125 PetriNetUnfolderBase]: For 17676/17691 co-relation queries the response was YES. [2023-08-26 21:29:56,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12801 conditions, 2366 events. 1457/2366 cut-off events. For 17676/17691 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12612 event pairs, 133 based on Foata normal form. 55/2419 useless extension candidates. Maximal degree in co-relation 12766. Up to 928 conditions per place. [2023-08-26 21:29:56,438 INFO L140 encePairwiseOnDemand]: 290/297 looper letters, 219 selfloop transitions, 18 changer transitions 1/239 dead transitions. [2023-08-26 21:29:56,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 239 transitions, 3232 flow [2023-08-26 21:29:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:29:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:29:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2023-08-26 21:29:56,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4531024531024531 [2023-08-26 21:29:56,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2023-08-26 21:29:56,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2023-08-26 21:29:56,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:56,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2023-08-26 21:29:56,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 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:29:56,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:56,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:29:56,447 INFO L175 Difference]: Start difference. First operand has 82 places, 109 transitions, 1154 flow. Second operand 7 states and 942 transitions. [2023-08-26 21:29:56,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 239 transitions, 3232 flow [2023-08-26 21:29:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 239 transitions, 2730 flow, removed 110 selfloop flow, removed 9 redundant places. [2023-08-26 21:29:56,463 INFO L231 Difference]: Finished difference. Result has 80 places, 100 transitions, 933 flow [2023-08-26 21:29:56,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=933, PETRI_PLACES=80, PETRI_TRANSITIONS=100} [2023-08-26 21:29:56,463 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2023-08-26 21:29:56,464 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 933 flow [2023-08-26 21:29:56,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:29:56,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:56,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:56,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:29:56,464 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:56,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash -954738424, now seen corresponding path program 1 times [2023-08-26 21:29:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898430069] [2023-08-26 21:29:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:56,679 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:29:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898430069] [2023-08-26 21:29:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898430069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:29:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222821353] [2023-08-26 21:29:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:56,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:29:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:29:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:29:56,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 297 [2023-08-26 21:29:56,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 933 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:56,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:56,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 297 [2023-08-26 21:29:56,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:57,277 INFO L124 PetriNetUnfolderBase]: 2881/4534 cut-off events. [2023-08-26 21:29:57,277 INFO L125 PetriNetUnfolderBase]: For 22743/22743 co-relation queries the response was YES. [2023-08-26 21:29:57,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23447 conditions, 4534 events. 2881/4534 cut-off events. For 22743/22743 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 25824 event pairs, 579 based on Foata normal form. 2/4536 useless extension candidates. Maximal degree in co-relation 23415. Up to 2324 conditions per place. [2023-08-26 21:29:57,298 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 118 selfloop transitions, 1 changer transitions 84/203 dead transitions. [2023-08-26 21:29:57,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 203 transitions, 2426 flow [2023-08-26 21:29:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:29:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:29:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-26 21:29:57,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468013468013468 [2023-08-26 21:29:57,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-26 21:29:57,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-26 21:29:57,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:57,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-26 21:29:57,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have 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:29:57,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:57,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have 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:29:57,303 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 933 flow. Second operand 4 states and 556 transitions. [2023-08-26 21:29:57,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 203 transitions, 2426 flow [2023-08-26 21:29:57,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 203 transitions, 2270 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-08-26 21:29:57,339 INFO L231 Difference]: Finished difference. Result has 77 places, 94 transitions, 812 flow [2023-08-26 21:29:57,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=812, PETRI_PLACES=77, PETRI_TRANSITIONS=94} [2023-08-26 21:29:57,340 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2023-08-26 21:29:57,340 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 94 transitions, 812 flow [2023-08-26 21:29:57,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:57,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:57,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:57,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:29:57,341 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:29:57,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1720262400, now seen corresponding path program 2 times [2023-08-26 21:29:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800261389] [2023-08-26 21:29:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:59,618 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:29:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800261389] [2023-08-26 21:29:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800261389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-26 21:29:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967296657] [2023-08-26 21:29:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:59,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 21:29:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 21:29:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-26 21:29:59,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 297 [2023-08-26 21:29:59,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 94 transitions, 812 flow. Second operand has 12 states, 12 states have (on average 98.91666666666667) internal successors, (1187), 12 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have 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:29:59,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:59,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 297 [2023-08-26 21:29:59,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:00,579 INFO L124 PetriNetUnfolderBase]: 1753/3002 cut-off events. [2023-08-26 21:30:00,579 INFO L125 PetriNetUnfolderBase]: For 12117/12117 co-relation queries the response was YES. [2023-08-26 21:30:00,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14177 conditions, 3002 events. 1753/3002 cut-off events. For 12117/12117 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17814 event pairs, 324 based on Foata normal form. 3/2992 useless extension candidates. Maximal degree in co-relation 14146. Up to 1057 conditions per place. [2023-08-26 21:30:00,590 INFO L140 encePairwiseOnDemand]: 289/297 looper letters, 142 selfloop transitions, 35 changer transitions 40/218 dead transitions. [2023-08-26 21:30:00,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 218 transitions, 1907 flow [2023-08-26 21:30:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:30:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:30:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 969 transitions. [2023-08-26 21:30:00,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36251402918069586 [2023-08-26 21:30:00,591 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 969 transitions. [2023-08-26 21:30:00,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 969 transitions. [2023-08-26 21:30:00,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:00,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 969 transitions. [2023-08-26 21:30:00,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 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:30:00,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have 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:30:00,595 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have 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:30:00,595 INFO L175 Difference]: Start difference. First operand has 77 places, 94 transitions, 812 flow. Second operand 9 states and 969 transitions. [2023-08-26 21:30:00,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 218 transitions, 1907 flow [2023-08-26 21:30:00,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 218 transitions, 1892 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 21:30:00,607 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 992 flow [2023-08-26 21:30:00,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=992, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2023-08-26 21:30:00,608 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2023-08-26 21:30:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 992 flow [2023-08-26 21:30:00,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.91666666666667) internal successors, (1187), 12 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have 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:30:00,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:00,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:00,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 21:30:00,609 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:00,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -498962438, now seen corresponding path program 3 times [2023-08-26 21:30:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571108296] [2023-08-26 21:30:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:02,182 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:30:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571108296] [2023-08-26 21:30:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571108296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 21:30:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678669359] [2023-08-26 21:30:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 21:30:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 21:30:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 21:30:02,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 297 [2023-08-26 21:30:02,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 992 flow. Second operand has 10 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have 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:30:02,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:02,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 297 [2023-08-26 21:30:02,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:02,754 INFO L124 PetriNetUnfolderBase]: 1819/3152 cut-off events. [2023-08-26 21:30:02,754 INFO L125 PetriNetUnfolderBase]: For 17251/17263 co-relation queries the response was YES. [2023-08-26 21:30:02,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16055 conditions, 3152 events. 1819/3152 cut-off events. For 17251/17263 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19321 event pairs, 446 based on Foata normal form. 13/3150 useless extension candidates. Maximal degree in co-relation 16021. Up to 1382 conditions per place. [2023-08-26 21:30:02,769 INFO L140 encePairwiseOnDemand]: 286/297 looper letters, 115 selfloop transitions, 31 changer transitions 35/182 dead transitions. [2023-08-26 21:30:02,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 182 transitions, 1828 flow [2023-08-26 21:30:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:30:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:30:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-08-26 21:30:02,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2023-08-26 21:30:02,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-08-26 21:30:02,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-08-26 21:30:02,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:02,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-08-26 21:30:02,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have 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:30:02,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:30:02,773 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:30:02,773 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 992 flow. Second operand 7 states and 858 transitions. [2023-08-26 21:30:02,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 182 transitions, 1828 flow [2023-08-26 21:30:02,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 182 transitions, 1785 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-26 21:30:02,798 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 983 flow [2023-08-26 21:30:02,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=983, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2023-08-26 21:30:02,798 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-08-26 21:30:02,799 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 983 flow [2023-08-26 21:30:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have 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:30:02,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:02,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:02,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 21:30:02,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:02,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1758062722, now seen corresponding path program 4 times [2023-08-26 21:30:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233358740] [2023-08-26 21:30:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:04,496 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:30:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233358740] [2023-08-26 21:30:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233358740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 21:30:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99567981] [2023-08-26 21:30:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 21:30:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 21:30:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-26 21:30:04,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 297 [2023-08-26 21:30:04,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 983 flow. Second operand has 10 states, 10 states have (on average 113.3) internal successors, (1133), 10 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:04,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:04,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 297 [2023-08-26 21:30:04,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:05,489 INFO L124 PetriNetUnfolderBase]: 2042/3570 cut-off events. [2023-08-26 21:30:05,489 INFO L125 PetriNetUnfolderBase]: For 22005/22019 co-relation queries the response was YES. [2023-08-26 21:30:05,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17945 conditions, 3570 events. 2042/3570 cut-off events. For 22005/22019 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22600 event pairs, 519 based on Foata normal form. 14/3569 useless extension candidates. Maximal degree in co-relation 17909. Up to 1124 conditions per place. [2023-08-26 21:30:05,507 INFO L140 encePairwiseOnDemand]: 289/297 looper letters, 140 selfloop transitions, 24 changer transitions 63/228 dead transitions. [2023-08-26 21:30:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 228 transitions, 2216 flow [2023-08-26 21:30:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:30:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:30:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2023-08-26 21:30:05,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104002992891882 [2023-08-26 21:30:05,509 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2023-08-26 21:30:05,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2023-08-26 21:30:05,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:05,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2023-08-26 21:30:05,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have 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:30:05,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have 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:30:05,513 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 297.0) internal successors, (2970), 10 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have 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:30:05,513 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 983 flow. Second operand 9 states and 1097 transitions. [2023-08-26 21:30:05,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 228 transitions, 2216 flow [2023-08-26 21:30:05,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 228 transitions, 2139 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-26 21:30:05,557 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 1036 flow [2023-08-26 21:30:05,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1036, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2023-08-26 21:30:05,557 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2023-08-26 21:30:05,558 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 1036 flow [2023-08-26 21:30:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.3) internal successors, (1133), 10 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:05,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:05,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 21:30:05,558 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:05,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 462729810, now seen corresponding path program 5 times [2023-08-26 21:30:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830294860] [2023-08-26 21:30:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:07,337 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:30:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830294860] [2023-08-26 21:30:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830294860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 21:30:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598716962] [2023-08-26 21:30:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:07,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 21:30:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 21:30:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-26 21:30:07,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 297 [2023-08-26 21:30:07,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 1036 flow. Second operand has 11 states, 11 states have (on average 99.0909090909091) internal successors, (1090), 11 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have 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:30:07,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:07,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 297 [2023-08-26 21:30:07,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:08,350 INFO L124 PetriNetUnfolderBase]: 2032/3560 cut-off events. [2023-08-26 21:30:08,351 INFO L125 PetriNetUnfolderBase]: For 26200/26212 co-relation queries the response was YES. [2023-08-26 21:30:08,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18605 conditions, 3560 events. 2032/3560 cut-off events. For 26200/26212 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22630 event pairs, 498 based on Foata normal form. 13/3560 useless extension candidates. Maximal degree in co-relation 18567. Up to 1360 conditions per place. [2023-08-26 21:30:08,369 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 133 selfloop transitions, 40 changer transitions 57/231 dead transitions. [2023-08-26 21:30:08,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 231 transitions, 2313 flow [2023-08-26 21:30:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:30:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:30:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1172 transitions. [2023-08-26 21:30:08,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35873890419344967 [2023-08-26 21:30:08,371 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1172 transitions. [2023-08-26 21:30:08,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1172 transitions. [2023-08-26 21:30:08,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:08,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1172 transitions. [2023-08-26 21:30:08,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.54545454545455) internal successors, (1172), 11 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have 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:30:08,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have 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:30:08,376 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 297.0) internal successors, (3564), 12 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have 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:30:08,376 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 1036 flow. Second operand 11 states and 1172 transitions. [2023-08-26 21:30:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 231 transitions, 2313 flow [2023-08-26 21:30:08,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 231 transitions, 2273 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 21:30:08,439 INFO L231 Difference]: Finished difference. Result has 103 places, 95 transitions, 1145 flow [2023-08-26 21:30:08,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1145, PETRI_PLACES=103, PETRI_TRANSITIONS=95} [2023-08-26 21:30:08,440 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 56 predicate places. [2023-08-26 21:30:08,440 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 1145 flow [2023-08-26 21:30:08,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.0909090909091) internal successors, (1090), 11 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have 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:30:08,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:08,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 21:30:08,441 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:08,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 552362656, now seen corresponding path program 6 times [2023-08-26 21:30:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440099916] [2023-08-26 21:30:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:09,667 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:30:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440099916] [2023-08-26 21:30:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440099916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 21:30:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988126367] [2023-08-26 21:30:09,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:09,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 21:30:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:09,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 21:30:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-26 21:30:09,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 297 [2023-08-26 21:30:09,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 1145 flow. Second operand has 11 states, 11 states have (on average 105.0909090909091) internal successors, (1156), 11 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:30:09,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:09,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 297 [2023-08-26 21:30:09,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:10,279 INFO L124 PetriNetUnfolderBase]: 1722/3018 cut-off events. [2023-08-26 21:30:10,280 INFO L125 PetriNetUnfolderBase]: For 29081/29095 co-relation queries the response was YES. [2023-08-26 21:30:10,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 3018 events. 1722/3018 cut-off events. For 29081/29095 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18569 event pairs, 511 based on Foata normal form. 14/3017 useless extension candidates. Maximal degree in co-relation 16774. Up to 1582 conditions per place. [2023-08-26 21:30:10,295 INFO L140 encePairwiseOnDemand]: 290/297 looper letters, 95 selfloop transitions, 18 changer transitions 43/157 dead transitions. [2023-08-26 21:30:10,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 157 transitions, 1822 flow [2023-08-26 21:30:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:30:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:30:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 783 transitions. [2023-08-26 21:30:10,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2023-08-26 21:30:10,297 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 783 transitions. [2023-08-26 21:30:10,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 783 transitions. [2023-08-26 21:30:10,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:10,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 783 transitions. [2023-08-26 21:30:10,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have 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:30:10,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:30:10,299 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 297.0) internal successors, (2376), 8 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have 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:30:10,299 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 1145 flow. Second operand 7 states and 783 transitions. [2023-08-26 21:30:10,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 157 transitions, 1822 flow [2023-08-26 21:30:10,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 157 transitions, 1696 flow, removed 44 selfloop flow, removed 7 redundant places. [2023-08-26 21:30:10,337 INFO L231 Difference]: Finished difference. Result has 103 places, 78 transitions, 896 flow [2023-08-26 21:30:10,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=896, PETRI_PLACES=103, PETRI_TRANSITIONS=78} [2023-08-26 21:30:10,338 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 56 predicate places. [2023-08-26 21:30:10,338 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 78 transitions, 896 flow [2023-08-26 21:30:10,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 105.0909090909091) internal successors, (1156), 11 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:30:10,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:10,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:10,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 21:30:10,339 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:10,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1954806190, now seen corresponding path program 7 times [2023-08-26 21:30:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523663013] [2023-08-26 21:30:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:12,670 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:30:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523663013] [2023-08-26 21:30:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523663013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-26 21:30:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573126569] [2023-08-26 21:30:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:12,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 21:30:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 21:30:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-08-26 21:30:12,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 297 [2023-08-26 21:30:12,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 78 transitions, 896 flow. Second operand has 12 states, 12 states have (on average 97.91666666666667) internal successors, (1175), 12 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have 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:30:12,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:12,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 297 [2023-08-26 21:30:12,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:13,971 INFO L124 PetriNetUnfolderBase]: 1652/2854 cut-off events. [2023-08-26 21:30:13,972 INFO L125 PetriNetUnfolderBase]: For 32778/32778 co-relation queries the response was YES. [2023-08-26 21:30:13,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16500 conditions, 2854 events. 1652/2854 cut-off events. For 32778/32778 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17102 event pairs, 292 based on Foata normal form. 1/2845 useless extension candidates. Maximal degree in co-relation 16470. Up to 1939 conditions per place. [2023-08-26 21:30:13,987 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 175 selfloop transitions, 31 changer transitions 30/237 dead transitions. [2023-08-26 21:30:13,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 237 transitions, 2564 flow [2023-08-26 21:30:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 21:30:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 21:30:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1277 transitions. [2023-08-26 21:30:13,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35830527497194165 [2023-08-26 21:30:13,989 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1277 transitions. [2023-08-26 21:30:13,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1277 transitions. [2023-08-26 21:30:13,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:13,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1277 transitions. [2023-08-26 21:30:13,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 106.41666666666667) internal successors, (1277), 12 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have 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:30:13,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have 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:30:13,994 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 297.0) internal successors, (3861), 13 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have 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:30:13,994 INFO L175 Difference]: Start difference. First operand has 103 places, 78 transitions, 896 flow. Second operand 12 states and 1277 transitions. [2023-08-26 21:30:13,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 237 transitions, 2564 flow [2023-08-26 21:30:14,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 237 transitions, 2359 flow, removed 70 selfloop flow, removed 11 redundant places. [2023-08-26 21:30:14,056 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 1195 flow [2023-08-26 21:30:14,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1195, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2023-08-26 21:30:14,056 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2023-08-26 21:30:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 1195 flow [2023-08-26 21:30:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 97.91666666666667) internal successors, (1175), 12 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have 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:30:14,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:14,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:14,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 21:30:14,057 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:14,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -77235750, now seen corresponding path program 8 times [2023-08-26 21:30:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813146041] [2023-08-26 21:30:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:15,783 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:30:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813146041] [2023-08-26 21:30:15,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813146041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:15,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 21:30:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814010271] [2023-08-26 21:30:15,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:15,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 21:30:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:15,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 21:30:15,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-26 21:30:15,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 297 [2023-08-26 21:30:15,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 1195 flow. Second operand has 10 states, 10 states have (on average 110.3) internal successors, (1103), 10 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have 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:30:15,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:15,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 297 [2023-08-26 21:30:15,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:16,601 INFO L124 PetriNetUnfolderBase]: 1819/3171 cut-off events. [2023-08-26 21:30:16,602 INFO L125 PetriNetUnfolderBase]: For 27836/27839 co-relation queries the response was YES. [2023-08-26 21:30:16,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17627 conditions, 3171 events. 1819/3171 cut-off events. For 27836/27839 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19582 event pairs, 445 based on Foata normal form. 1/3158 useless extension candidates. Maximal degree in co-relation 17598. Up to 2498 conditions per place. [2023-08-26 21:30:16,615 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 146 selfloop transitions, 19 changer transitions 6/172 dead transitions. [2023-08-26 21:30:16,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 172 transitions, 2046 flow [2023-08-26 21:30:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:30:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:30:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 932 transitions. [2023-08-26 21:30:16,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39225589225589225 [2023-08-26 21:30:16,617 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 932 transitions. [2023-08-26 21:30:16,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 932 transitions. [2023-08-26 21:30:16,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:16,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 932 transitions. [2023-08-26 21:30:16,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.5) internal successors, (932), 8 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:30:16,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have 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:30:16,620 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have 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:30:16,620 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 1195 flow. Second operand 8 states and 932 transitions. [2023-08-26 21:30:16,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 172 transitions, 2046 flow [2023-08-26 21:30:16,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 172 transitions, 1935 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:16,653 INFO L231 Difference]: Finished difference. Result has 104 places, 107 transitions, 1307 flow [2023-08-26 21:30:16,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1307, PETRI_PLACES=104, PETRI_TRANSITIONS=107} [2023-08-26 21:30:16,654 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 57 predicate places. [2023-08-26 21:30:16,654 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 107 transitions, 1307 flow [2023-08-26 21:30:16,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.3) internal successors, (1103), 10 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have 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:30:16,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:16,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:16,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 21:30:16,655 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:30:16,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1412108928, now seen corresponding path program 9 times [2023-08-26 21:30:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158109036] [2023-08-26 21:30:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:16,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:30:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:16,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:30:16,776 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:30:16,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (19 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:30:16,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (6 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:30:16,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:30:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:30:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:30:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:30:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:30:16,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 21:30:16,781 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:16,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:30:16,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:30:16,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:30:16 BasicIcfg [2023-08-26 21:30:16,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:30:16,870 INFO L158 Benchmark]: Toolchain (without parser) took 69871.88ms. Allocated memory was 367.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 318.6MB in the beginning and 3.5GB in the end (delta: -3.1GB). Peak memory consumption was 327.9MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,870 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 367.0MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:30:16,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.82ms. Allocated memory is still 367.0MB. Free memory was 318.6MB in the beginning and 292.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.28ms. Allocated memory is still 367.0MB. Free memory was 292.3MB in the beginning and 289.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,870 INFO L158 Benchmark]: Boogie Preprocessor took 70.04ms. Allocated memory is still 367.0MB. Free memory was 289.2MB in the beginning and 287.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,871 INFO L158 Benchmark]: RCFGBuilder took 1034.21ms. Allocated memory is still 367.0MB. Free memory was 287.1MB in the beginning and 183.3MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,871 INFO L158 Benchmark]: TraceAbstraction took 68103.71ms. Allocated memory was 367.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 183.3MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 191.6MB. Max. memory is 16.0GB. [2023-08-26 21:30:16,872 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.15ms. Allocated memory is still 367.0MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 594.82ms. Allocated memory is still 367.0MB. Free memory was 318.6MB in the beginning and 292.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.28ms. Allocated memory is still 367.0MB. Free memory was 292.3MB in the beginning and 289.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 70.04ms. Allocated memory is still 367.0MB. Free memory was 289.2MB in the beginning and 287.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1034.21ms. Allocated memory is still 367.0MB. Free memory was 287.1MB in the beginning and 183.3MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. * TraceAbstraction took 68103.71ms. Allocated memory was 367.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 183.3MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 191.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 164 PlacesBefore, 47 PlacesAfterwards, 154 TransitionsBefore, 34 TransitionsAfterwards, 3960 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 139 TotalNumberOfCompositions, 13379 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4735, independent: 4401, independent conditional: 0, independent unconditional: 4401, dependent: 334, dependent conditional: 0, dependent unconditional: 334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2119, independent: 2056, independent conditional: 0, independent unconditional: 2056, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4735, independent: 2345, independent conditional: 0, independent unconditional: 2345, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 2119, unknown conditional: 0, unknown unconditional: 2119] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 0, Positive unconditional cache size: 192, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-2, t2421={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-1, t2421={6:0}, t2422={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=1, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] EXPR 2 __unbuffered_cnt + 1 [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] EXPR 3 __unbuffered_cnt + 1 [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L789] EXPR 1 __unbuffered_cnt + 1 [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L869] EXPR 4 __unbuffered_cnt + 1 [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe027_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 887]: 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: 889]: 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: 885]: 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: 891]: 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, 198 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: 67.9s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1317 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1317 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5659 IncrementalHoareTripleChecker+Invalid, 6072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 5 mSDtfsCounter, 5659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1307occurred in iteration=27, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 8224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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:30:16,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...