/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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:30:17,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:30:17,171 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:30:17,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:30:17,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:30:17,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:30:17,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:30:17,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:30:17,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:30:17,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:30:17,211 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:30:17,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:30:17,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:30:17,213 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:30:17,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:30:17,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:30:17,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:30:17,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:30:17,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:30:17,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:30:17,214 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:30:17,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:30:17,215 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:30:17,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:30:17,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:30:17,216 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:30:17,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:30:17,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:30:17,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:30:17,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:30:17,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:30:17,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:30:17,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:30:17,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:30:17,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:30:17,219 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:30:17,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:30:17,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:30:17,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:30:17,559 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:30:17,561 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:30:17,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:30:18,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:30:19,052 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:30:19,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:30:19,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84e44a32/342e0918be614083b3785a3e43a77ba5/FLAG0ac3eb3cf [2023-08-26 21:30:19,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84e44a32/342e0918be614083b3785a3e43a77ba5 [2023-08-26 21:30:19,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:30:19,085 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:30:19,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:30:19,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:30:19,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:30:19,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22798828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19, skipping insertion in model container [2023-08-26 21:30:19,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,134 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:30:19,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:30:19,514 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:30:19,542 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:30:19,544 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:30:19,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:30:19,618 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:30:19,618 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:30:19,624 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:30:19,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19 WrapperNode [2023-08-26 21:30:19,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:30:19,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:30:19,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:30:19,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:30:19,632 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:30:19" (1/1) ... [2023-08-26 21:30:19,666 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:30:19" (1/1) ... [2023-08-26 21:30:19,696 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-26 21:30:19,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:30:19,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:30:19,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:30:19,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:30:19,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:30:19,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:30:19,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:30:19,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:30:19,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (1/1) ... [2023-08-26 21:30:19,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:30:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:30:19,775 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:30:19,781 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:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:30:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:30:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:30:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:30:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:30:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:30:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:30:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:30:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:30:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:30:19,807 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:30:19,938 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:30:19,939 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:30:20,202 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:30:20,367 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:30:20,367 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:30:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:30:20 BoogieIcfgContainer [2023-08-26 21:30:20,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:30:20,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:30:20,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:30:20,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:30:20,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:30:19" (1/3) ... [2023-08-26 21:30:20,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26103e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:30:20, skipping insertion in model container [2023-08-26 21:30:20,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:30:19" (2/3) ... [2023-08-26 21:30:20,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26103e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:30:20, skipping insertion in model container [2023-08-26 21:30:20,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:30:20" (3/3) ... [2023-08-26 21:30:20,377 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:30:20,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:30:20,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:30:20,393 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:30:20,451 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:30:20,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 21:30:20,548 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 21:30:20,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:30:20,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:30:20,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 21:30:20,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 21:30:20,559 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:30:20,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 21:30:20,569 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 21:30:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 21:30:20,602 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 21:30:20,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:30:20,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:30:20,608 INFO L119 LiptonReduction]: Number of co-enabled transitions 2500 [2023-08-26 21:30:24,072 INFO L134 LiptonReduction]: Checked pairs total: 8512 [2023-08-26 21:30:24,072 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-26 21:30:24,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:30:24,100 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;@71cdb066, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:30:24,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:30:24,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:30:24,104 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:30:24,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:30:24,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:24,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:30:24,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:24,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 495005323, now seen corresponding path program 1 times [2023-08-26 21:30:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728513584] [2023-08-26 21:30:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:24,353 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:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728513584] [2023-08-26 21:30:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728513584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:30:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374578338] [2023-08-26 21:30:24,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:24,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:30:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:30:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:30:24,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-26 21:30:24,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have 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:24,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:24,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-26 21:30:24,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:24,670 INFO L124 PetriNetUnfolderBase]: 1108/1730 cut-off events. [2023-08-26 21:30:24,670 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 21:30:24,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3492 conditions, 1730 events. 1108/1730 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8503 event pairs, 318 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 3481. Up to 1358 conditions per place. [2023-08-26 21:30:24,727 INFO L140 encePairwiseOnDemand]: 208/219 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-26 21:30:24,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 187 flow [2023-08-26 21:30:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:30:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:30:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-26 21:30:24,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007610350076104 [2023-08-26 21:30:24,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-26 21:30:24,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-26 21:30:24,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:24,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-26 21:30:24,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have 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:24,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:24,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:24,760 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 329 transitions. [2023-08-26 21:30:24,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 187 flow [2023-08-26 21:30:24,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:30:24,764 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 96 flow [2023-08-26 21:30:24,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-26 21:30:24,768 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-26 21:30:24,768 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 96 flow [2023-08-26 21:30:24,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have 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:24,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:24,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:24,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:30:24,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:24,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -993294862, now seen corresponding path program 1 times [2023-08-26 21:30:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:24,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718624930] [2023-08-26 21:30:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:25,007 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:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718624930] [2023-08-26 21:30:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718624930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:30:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852631792] [2023-08-26 21:30:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:25,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:30:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:30:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:30:25,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-26 21:30:25,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:25,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:25,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-26 21:30:25,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:25,187 INFO L124 PetriNetUnfolderBase]: 781/1354 cut-off events. [2023-08-26 21:30:25,188 INFO L125 PetriNetUnfolderBase]: For 128/150 co-relation queries the response was YES. [2023-08-26 21:30:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 1354 events. 781/1354 cut-off events. For 128/150 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7494 event pairs, 167 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 3219. Up to 923 conditions per place. [2023-08-26 21:30:25,197 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 35 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-26 21:30:25,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 208 flow [2023-08-26 21:30:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:30:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:30:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-26 21:30:25,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-08-26 21:30:25,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-26 21:30:25,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-26 21:30:25,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:25,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-26 21:30:25,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have 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:25,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:25,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:25,206 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 96 flow. Second operand 3 states and 324 transitions. [2023-08-26 21:30:25,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 208 flow [2023-08-26 21:30:25,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:30:25,210 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2023-08-26 21:30:25,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-26 21:30:25,211 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-26 21:30:25,211 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2023-08-26 21:30:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have 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:25,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:25,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:25,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:30:25,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:25,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1073560410, now seen corresponding path program 1 times [2023-08-26 21:30:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562802783] [2023-08-26 21:30:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:25,422 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:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562802783] [2023-08-26 21:30:25,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562802783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:25,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:25,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:30:25,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403929320] [2023-08-26 21:30:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:25,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:30:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:30:25,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:30:25,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-26 21:30:25,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:25,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:25,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-26 21:30:25,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:25,772 INFO L124 PetriNetUnfolderBase]: 1813/2983 cut-off events. [2023-08-26 21:30:25,773 INFO L125 PetriNetUnfolderBase]: For 364/409 co-relation queries the response was YES. [2023-08-26 21:30:25,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7082 conditions, 2983 events. 1813/2983 cut-off events. For 364/409 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17325 event pairs, 630 based on Foata normal form. 8/2526 useless extension candidates. Maximal degree in co-relation 7070. Up to 1646 conditions per place. [2023-08-26 21:30:25,789 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 43 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2023-08-26 21:30:25,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 262 flow [2023-08-26 21:30:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:30:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:30:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-08-26 21:30:25,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824961948249619 [2023-08-26 21:30:25,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-08-26 21:30:25,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-08-26 21:30:25,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:25,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-08-26 21:30:25,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:25,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:25,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:25,794 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 3 states and 317 transitions. [2023-08-26 21:30:25,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 262 flow [2023-08-26 21:30:25,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:25,797 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 136 flow [2023-08-26 21:30:25,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-08-26 21:30:25,798 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-26 21:30:25,798 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 136 flow [2023-08-26 21:30:25,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:25,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:25,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:25,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:30:25,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:25,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -153145799, now seen corresponding path program 1 times [2023-08-26 21:30:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775870264] [2023-08-26 21:30:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:25,882 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:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:25,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775870264] [2023-08-26 21:30:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775870264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:30:25,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687224318] [2023-08-26 21:30:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:25,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:25,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:25,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-26 21:30:25,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:25,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:25,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-26 21:30:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:26,172 INFO L124 PetriNetUnfolderBase]: 1424/2256 cut-off events. [2023-08-26 21:30:26,173 INFO L125 PetriNetUnfolderBase]: For 1198/1213 co-relation queries the response was YES. [2023-08-26 21:30:26,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 2256 events. 1424/2256 cut-off events. For 1198/1213 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12185 event pairs, 357 based on Foata normal form. 5/1870 useless extension candidates. Maximal degree in co-relation 6342. Up to 1685 conditions per place. [2023-08-26 21:30:26,188 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 39 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-26 21:30:26,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 266 flow [2023-08-26 21:30:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:30:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:30:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-08-26 21:30:26,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-26 21:30:26,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-08-26 21:30:26,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-08-26 21:30:26,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:26,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-08-26 21:30:26,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have 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:26,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:26,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:26,194 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 136 flow. Second operand 4 states and 412 transitions. [2023-08-26 21:30:26,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 266 flow [2023-08-26 21:30:26,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:26,201 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 120 flow [2023-08-26 21:30:26,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-26 21:30:26,202 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-26 21:30:26,202 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 120 flow [2023-08-26 21:30:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:26,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:26,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:30:26,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:26,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -267974600, now seen corresponding path program 1 times [2023-08-26 21:30:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254607179] [2023-08-26 21:30:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:26,257 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:26,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:26,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254607179] [2023-08-26 21:30:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254607179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:26,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:30:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103392824] [2023-08-26 21:30:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:26,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-26 21:30:26,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:26,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:26,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-26 21:30:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:26,550 INFO L124 PetriNetUnfolderBase]: 1052/1674 cut-off events. [2023-08-26 21:30:26,551 INFO L125 PetriNetUnfolderBase]: For 935/950 co-relation queries the response was YES. [2023-08-26 21:30:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 1674 events. 1052/1674 cut-off events. For 935/950 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8634 event pairs, 260 based on Foata normal form. 5/1496 useless extension candidates. Maximal degree in co-relation 4641. Up to 695 conditions per place. [2023-08-26 21:30:26,562 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 53 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2023-08-26 21:30:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 346 flow [2023-08-26 21:30:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:30:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:30:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-26 21:30:26,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863013698630137 [2023-08-26 21:30:26,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-26 21:30:26,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-26 21:30:26,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:26,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-26 21:30:26,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have 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:26,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:26,569 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:26,569 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 120 flow. Second operand 4 states and 426 transitions. [2023-08-26 21:30:26,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 346 flow [2023-08-26 21:30:26,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:26,571 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 159 flow [2023-08-26 21:30:26,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-08-26 21:30:26,572 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-26 21:30:26,572 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 159 flow [2023-08-26 21:30:26,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have 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:26,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:26,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:30:26,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:26,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -226667024, now seen corresponding path program 1 times [2023-08-26 21:30:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735806651] [2023-08-26 21:30:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:26,692 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:26,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735806651] [2023-08-26 21:30:26,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735806651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:26,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:26,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:30:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918310304] [2023-08-26 21:30:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:26,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:26,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-26 21:30:26,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-26 21:30:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:26,887 INFO L124 PetriNetUnfolderBase]: 721/1251 cut-off events. [2023-08-26 21:30:26,888 INFO L125 PetriNetUnfolderBase]: For 1149/1149 co-relation queries the response was YES. [2023-08-26 21:30:26,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 1251 events. 721/1251 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6648 event pairs, 144 based on Foata normal form. 102/1232 useless extension candidates. Maximal degree in co-relation 4002. Up to 849 conditions per place. [2023-08-26 21:30:26,895 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 57 selfloop transitions, 8 changer transitions 3/72 dead transitions. [2023-08-26 21:30:26,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 456 flow [2023-08-26 21:30:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-08-26 21:30:26,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45662100456621 [2023-08-26 21:30:26,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-08-26 21:30:26,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-08-26 21:30:26,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:26,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-08-26 21:30:26,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:26,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:26,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:26,900 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 159 flow. Second operand 5 states and 500 transitions. [2023-08-26 21:30:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 456 flow [2023-08-26 21:30:26,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 430 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:26,903 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 202 flow [2023-08-26 21:30:26,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-08-26 21:30:26,904 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2023-08-26 21:30:26,904 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 202 flow [2023-08-26 21:30:26,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:26,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:26,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:26,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:30:26,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:26,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1113968600, now seen corresponding path program 1 times [2023-08-26 21:30:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706712728] [2023-08-26 21:30:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:27,019 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:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:27,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706712728] [2023-08-26 21:30:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706712728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:27,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:27,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:30:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929572457] [2023-08-26 21:30:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:27,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:30:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:30:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:30:27,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-26 21:30:27,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:27,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:27,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-26 21:30:27,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:27,209 INFO L124 PetriNetUnfolderBase]: 467/870 cut-off events. [2023-08-26 21:30:27,209 INFO L125 PetriNetUnfolderBase]: For 1111/1111 co-relation queries the response was YES. [2023-08-26 21:30:27,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 870 events. 467/870 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4552 event pairs, 73 based on Foata normal form. 67/858 useless extension candidates. Maximal degree in co-relation 2965. Up to 234 conditions per place. [2023-08-26 21:30:27,215 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 67 selfloop transitions, 15 changer transitions 3/89 dead transitions. [2023-08-26 21:30:27,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 552 flow [2023-08-26 21:30:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:30:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:30:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 697 transitions. [2023-08-26 21:30:27,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4546640574037834 [2023-08-26 21:30:27,217 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 697 transitions. [2023-08-26 21:30:27,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 697 transitions. [2023-08-26 21:30:27,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:27,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 697 transitions. [2023-08-26 21:30:27,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have 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:27,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:27,250 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:27,250 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 202 flow. Second operand 7 states and 697 transitions. [2023-08-26 21:30:27,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 552 flow [2023-08-26 21:30:27,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:30:27,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 260 flow [2023-08-26 21:30:27,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-26 21:30:27,259 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-08-26 21:30:27,259 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 260 flow [2023-08-26 21:30:27,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:27,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:27,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:27,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:30:27,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:27,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -478120154, now seen corresponding path program 1 times [2023-08-26 21:30:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318831159] [2023-08-26 21:30:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:27,417 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:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318831159] [2023-08-26 21:30:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318831159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:30:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142459242] [2023-08-26 21:30:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:27,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:27,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-26 21:30:27,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have 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:27,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:27,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-26 21:30:27,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:27,634 INFO L124 PetriNetUnfolderBase]: 727/1321 cut-off events. [2023-08-26 21:30:27,634 INFO L125 PetriNetUnfolderBase]: For 3146/3146 co-relation queries the response was YES. [2023-08-26 21:30:27,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 1321 events. 727/1321 cut-off events. For 3146/3146 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7218 event pairs, 31 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 5208. Up to 608 conditions per place. [2023-08-26 21:30:27,643 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 100 selfloop transitions, 13 changer transitions 1/114 dead transitions. [2023-08-26 21:30:27,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 114 transitions, 975 flow [2023-08-26 21:30:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:30:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:30:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-08-26 21:30:27,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684931506849315 [2023-08-26 21:30:27,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-08-26 21:30:27,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-08-26 21:30:27,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:27,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-08-26 21:30:27,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:27,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:27,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:27,649 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 260 flow. Second operand 5 states and 513 transitions. [2023-08-26 21:30:27,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 114 transitions, 975 flow [2023-08-26 21:30:27,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 114 transitions, 887 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 21:30:27,660 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 325 flow [2023-08-26 21:30:27,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-08-26 21:30:27,661 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-08-26 21:30:27,661 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 325 flow [2023-08-26 21:30:27,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have 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:27,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:27,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:27,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:30:27,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:27,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2081415460, now seen corresponding path program 2 times [2023-08-26 21:30:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927554558] [2023-08-26 21:30:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:27,820 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:27,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:27,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927554558] [2023-08-26 21:30:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927554558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:27,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:27,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:30:27,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220216886] [2023-08-26 21:30:27,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:27,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:30:27,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:27,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:30:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:30:27,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-26 21:30:27,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:27,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:27,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-26 21:30:27,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:28,038 INFO L124 PetriNetUnfolderBase]: 489/900 cut-off events. [2023-08-26 21:30:28,038 INFO L125 PetriNetUnfolderBase]: For 2247/2260 co-relation queries the response was YES. [2023-08-26 21:30:28,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 900 events. 489/900 cut-off events. For 2247/2260 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4857 event pairs, 32 based on Foata normal form. 28/909 useless extension candidates. Maximal degree in co-relation 3716. Up to 226 conditions per place. [2023-08-26 21:30:28,050 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 47 selfloop transitions, 14 changer transitions 36/105 dead transitions. [2023-08-26 21:30:28,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 802 flow [2023-08-26 21:30:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:30:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:30:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2023-08-26 21:30:28,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-26 21:30:28,054 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 876 transitions. [2023-08-26 21:30:28,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 876 transitions. [2023-08-26 21:30:28,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:28,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 876 transitions. [2023-08-26 21:30:28,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:28,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have 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:28,060 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have 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:28,060 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 325 flow. Second operand 9 states and 876 transitions. [2023-08-26 21:30:28,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 802 flow [2023-08-26 21:30:28,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:30:28,070 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 286 flow [2023-08-26 21:30:28,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-08-26 21:30:28,071 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-08-26 21:30:28,071 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 286 flow [2023-08-26 21:30:28,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:30:28,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:28,072 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:30:28,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:30:28,072 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:28,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1153892396, now seen corresponding path program 1 times [2023-08-26 21:30:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231708564] [2023-08-26 21:30:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:28,289 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:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231708564] [2023-08-26 21:30:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231708564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:30:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670566910] [2023-08-26 21:30:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:30:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:30:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:30:28,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-08-26 21:30:28,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have 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:28,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:28,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-08-26 21:30:28,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:28,452 INFO L124 PetriNetUnfolderBase]: 469/912 cut-off events. [2023-08-26 21:30:28,452 INFO L125 PetriNetUnfolderBase]: For 3469/3489 co-relation queries the response was YES. [2023-08-26 21:30:28,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 912 events. 469/912 cut-off events. For 3469/3489 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5172 event pairs, 187 based on Foata normal form. 1/890 useless extension candidates. Maximal degree in co-relation 4165. Up to 465 conditions per place. [2023-08-26 21:30:28,456 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 27 selfloop transitions, 3 changer transitions 30/62 dead transitions. [2023-08-26 21:30:28,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 600 flow [2023-08-26 21:30:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:30:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:30:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-08-26 21:30:28,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471841704718417 [2023-08-26 21:30:28,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-08-26 21:30:28,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-08-26 21:30:28,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:28,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-08-26 21:30:28,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have 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:28,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:28,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have 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:28,462 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 286 flow. Second operand 3 states and 310 transitions. [2023-08-26 21:30:28,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 600 flow [2023-08-26 21:30:28,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 493 flow, removed 20 selfloop flow, removed 10 redundant places. [2023-08-26 21:30:28,474 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 169 flow [2023-08-26 21:30:28,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-08-26 21:30:28,475 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-08-26 21:30:28,476 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 169 flow [2023-08-26 21:30:28,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have 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:28,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:28,476 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:30:28,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:30:28,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:28,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash -784468474, now seen corresponding path program 2 times [2023-08-26 21:30:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:28,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339899036] [2023-08-26 21:30:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:28,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:28,956 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:28,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:28,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339899036] [2023-08-26 21:30:28,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339899036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:28,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:28,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:30:28,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99650045] [2023-08-26 21:30:28,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:28,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:30:28,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:30:28,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:30:28,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-08-26 21:30:28,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:28,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:28,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-08-26 21:30:28,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:29,058 INFO L124 PetriNetUnfolderBase]: 62/151 cut-off events. [2023-08-26 21:30:29,058 INFO L125 PetriNetUnfolderBase]: For 263/265 co-relation queries the response was YES. [2023-08-26 21:30:29,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 151 events. 62/151 cut-off events. For 263/265 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 548 event pairs, 4 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 586. Up to 68 conditions per place. [2023-08-26 21:30:29,059 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 27 selfloop transitions, 4 changer transitions 17/51 dead transitions. [2023-08-26 21:30:29,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 408 flow [2023-08-26 21:30:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:30:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:30:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2023-08-26 21:30:29,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298760600130463 [2023-08-26 21:30:29,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2023-08-26 21:30:29,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2023-08-26 21:30:29,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:29,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2023-08-26 21:30:29,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have 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:29,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:29,066 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:29,067 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 169 flow. Second operand 7 states and 659 transitions. [2023-08-26 21:30:29,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 408 flow [2023-08-26 21:30:29,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 368 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-26 21:30:29,069 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 160 flow [2023-08-26 21:30:29,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-26 21:30:29,069 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-08-26 21:30:29,069 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 160 flow [2023-08-26 21:30:29,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:29,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:29,070 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:30:29,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:30:29,070 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:29,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1065635606, now seen corresponding path program 3 times [2023-08-26 21:30:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051699938] [2023-08-26 21:30:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:30:29,244 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:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:30:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051699938] [2023-08-26 21:30:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051699938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:30:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:30:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:30:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952129619] [2023-08-26 21:30:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:30:29,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:30:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:30:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:30:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:30:29,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-26 21:30:29,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:29,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:30:29,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-26 21:30:29,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:30:29,318 INFO L124 PetriNetUnfolderBase]: 63/152 cut-off events. [2023-08-26 21:30:29,318 INFO L125 PetriNetUnfolderBase]: For 289/291 co-relation queries the response was YES. [2023-08-26 21:30:29,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 152 events. 63/152 cut-off events. For 289/291 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 14 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 599. Up to 65 conditions per place. [2023-08-26 21:30:29,319 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 1 changer transitions 23/49 dead transitions. [2023-08-26 21:30:29,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 366 flow [2023-08-26 21:30:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:30:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:30:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-26 21:30:29,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634703196347032 [2023-08-26 21:30:29,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-26 21:30:29,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-26 21:30:29,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:30:29,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-26 21:30:29,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 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:30:29,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:29,324 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:29,324 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 160 flow. Second operand 4 states and 406 transitions. [2023-08-26 21:30:29,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 366 flow [2023-08-26 21:30:29,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 348 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 21:30:29,327 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 124 flow [2023-08-26 21:30:29,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2023-08-26 21:30:29,327 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2023-08-26 21:30:29,327 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 124 flow [2023-08-26 21:30:29,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:29,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:30:29,328 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:30:29,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:30:29,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:30:29,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:30:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1362685122, now seen corresponding path program 4 times [2023-08-26 21:30:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:30:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255215151] [2023-08-26 21:30:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:30:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:30:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:29,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:30:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:30:29,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:30:29,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:30:29,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:30:29,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:30:29,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:30:29,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:30:29,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:30:29,461 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:30:29,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:30:29,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:30:29,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:30:29 BasicIcfg [2023-08-26 21:30:29,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:30:29,527 INFO L158 Benchmark]: Toolchain (without parser) took 10442.23ms. Allocated memory was 358.6MB in the beginning and 591.4MB in the end (delta: 232.8MB). Free memory was 333.8MB in the beginning and 553.7MB in the end (delta: -219.9MB). Peak memory consumption was 346.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,527 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 358.6MB. Free memory is still 335.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:30:29,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.48ms. Allocated memory is still 358.6MB. Free memory was 333.8MB in the beginning and 311.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.98ms. Allocated memory is still 358.6MB. Free memory was 311.0MB in the beginning and 308.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,528 INFO L158 Benchmark]: Boogie Preprocessor took 48.18ms. Allocated memory is still 358.6MB. Free memory was 308.6MB in the beginning and 306.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,528 INFO L158 Benchmark]: RCFGBuilder took 623.85ms. Allocated memory is still 358.6MB. Free memory was 306.9MB in the beginning and 329.2MB in the end (delta: -22.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,529 INFO L158 Benchmark]: TraceAbstraction took 9155.54ms. Allocated memory was 358.6MB in the beginning and 591.4MB in the end (delta: 232.8MB). Free memory was 328.4MB in the beginning and 553.7MB in the end (delta: -225.3MB). Peak memory consumption was 341.7MB. Max. memory is 16.0GB. [2023-08-26 21:30:29,530 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.12ms. Allocated memory is still 358.6MB. Free memory is still 335.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 539.48ms. Allocated memory is still 358.6MB. Free memory was 333.8MB in the beginning and 311.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.98ms. Allocated memory is still 358.6MB. Free memory was 311.0MB in the beginning and 308.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.18ms. Allocated memory is still 358.6MB. Free memory was 308.6MB in the beginning and 306.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 623.85ms. Allocated memory is still 358.6MB. Free memory was 306.9MB in the beginning and 329.2MB in the end (delta: -22.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. * TraceAbstraction took 9155.54ms. Allocated memory was 358.6MB in the beginning and 591.4MB in the end (delta: 232.8MB). Free memory was 328.4MB in the beginning and 553.7MB in the end (delta: -225.3MB). Peak memory consumption was 341.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 120 PlacesBefore, 37 PlacesAfterwards, 113 TransitionsBefore, 28 TransitionsAfterwards, 2500 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 8512 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3881, independent: 3621, independent conditional: 0, independent unconditional: 3621, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1409, independent: 1353, independent conditional: 0, independent unconditional: 1353, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3881, independent: 2268, independent conditional: 0, independent unconditional: 2268, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1409, unknown conditional: 0, unknown unconditional: 1409] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-1, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=0, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=1, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] EXPR 3 __unbuffered_cnt + 1 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L783] EXPR 2 __unbuffered_cnt + 1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L753] EXPR 1 __unbuffered_cnt + 1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 753]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 18 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: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 842 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 12 mSDtfsCounter, 842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:29,553 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...