/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:52:22,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:52:22,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:52:22,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:52:22,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:52:22,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:52:22,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:52:22,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:52:22,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:52:22,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:52:22,517 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:52:22,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:52:22,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:52:22,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:52:22,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:52:22,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:52:22,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:52:22,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:52:22,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:52:22,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:52:22,519 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:52:22,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:52:22,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:52:22,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:52:22,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:52:22,526 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:52:22,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:52:22,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:52:22,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:52:22,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:52:22,527 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:52:22,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:52:22,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:52:22,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:52:22,796 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:52:22,797 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:52:22,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-27 03:52:23,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:52:24,159 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:52:24,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-27 03:52:24,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3402489/a3bf9a6c1579430d8ee65258fe549dfd/FLAG895aec047 [2023-08-27 03:52:24,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3402489/a3bf9a6c1579430d8ee65258fe549dfd [2023-08-27 03:52:24,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:52:24,196 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:52:24,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:52:24,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:52:24,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:52:24,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619f7879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24, skipping insertion in model container [2023-08-27 03:52:24,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,244 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:52:24,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:52:24,492 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:52:24,516 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:52:24,517 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:52:24,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:52:24,572 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:52:24,573 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:52:24,577 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:52:24,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24 WrapperNode [2023-08-27 03:52:24,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:52:24,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:52:24,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:52:24,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:52:24,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,630 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-27 03:52:24,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:52:24,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:52:24,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:52:24,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:52:24,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:52:24,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:52:24,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:52:24,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:52:24,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (1/1) ... [2023-08-27 03:52:24,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:52:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:52:24,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:52:24,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:52:24,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:52:24,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:52:24,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:52:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:52:24,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:52:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:52:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:52:24,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:52:24,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:52:24,734 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:52:24,814 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:52:24,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:52:25,019 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:52:25,134 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:52:25,134 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:52:25,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:52:25 BoogieIcfgContainer [2023-08-27 03:52:25,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:52:25,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:52:25,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:52:25,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:52:25,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:52:24" (1/3) ... [2023-08-27 03:52:25,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374c1340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:52:25, skipping insertion in model container [2023-08-27 03:52:25,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:24" (2/3) ... [2023-08-27 03:52:25,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374c1340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:52:25, skipping insertion in model container [2023-08-27 03:52:25,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:52:25" (3/3) ... [2023-08-27 03:52:25,141 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-27 03:52:25,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:52:25,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:52:25,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:52:25,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:52:25,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:52:25,303 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:52:25,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:52:25,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 03:52:25,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:52:25,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:25,314 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:52:25,320 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:25,324 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:25,349 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:52:25,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:52:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 03:52:25,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 2630 [2023-08-27 03:52:28,432 INFO L134 LiptonReduction]: Checked pairs total: 9127 [2023-08-27 03:52:28,432 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-27 03:52:28,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:52:28,444 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;@134657a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:52:28,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:52:28,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:52:28,447 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:52:28,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:52:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:28,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:52:28,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:28,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash 509309140, now seen corresponding path program 1 times [2023-08-27 03:52:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529801206] [2023-08-27 03:52:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529801206] [2023-08-27 03:52:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529801206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:52:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974546094] [2023-08-27 03:52:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:28,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:52:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:52:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:52:28,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-27 03:52:28,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:28,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:28,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-27 03:52:28,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:29,033 INFO L124 PetriNetUnfolderBase]: 1464/2442 cut-off events. [2023-08-27 03:52:29,034 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-27 03:52:29,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4659 conditions, 2442 events. 1464/2442 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14069 event pairs, 192 based on Foata normal form. 0/1915 useless extension candidates. Maximal degree in co-relation 4648. Up to 1813 conditions per place. [2023-08-27 03:52:29,054 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 34 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-27 03:52:29,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 166 flow [2023-08-27 03:52:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:52:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:52:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-08-27 03:52:29,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2023-08-27 03:52:29,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-08-27 03:52:29,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-08-27 03:52:29,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:29,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-08-27 03:52:29,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,082 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 330 transitions. [2023-08-27 03:52:29,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 166 flow [2023-08-27 03:52:29,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:52:29,087 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 64 flow [2023-08-27 03:52:29,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-27 03:52:29,092 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2023-08-27 03:52:29,092 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2023-08-27 03:52:29,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:29,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:52:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:52:29,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:29,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 509256376, now seen corresponding path program 1 times [2023-08-27 03:52:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124396970] [2023-08-27 03:52:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124396970] [2023-08-27 03:52:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124396970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:52:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132508860] [2023-08-27 03:52:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:29,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:52:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:52:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:52:29,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 03:52:29,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:29,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 03:52:29,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:29,360 INFO L124 PetriNetUnfolderBase]: 1175/1835 cut-off events. [2023-08-27 03:52:29,360 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-27 03:52:29,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1835 events. 1175/1835 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8920 event pairs, 367 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 3801. Up to 1383 conditions per place. [2023-08-27 03:52:29,369 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-27 03:52:29,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 188 flow [2023-08-27 03:52:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:52:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:52:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-08-27 03:52:29,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-08-27 03:52:29,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-08-27 03:52:29,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-08-27 03:52:29,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:29,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-08-27 03:52:29,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,373 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 3 states and 327 transitions. [2023-08-27 03:52:29,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 188 flow [2023-08-27 03:52:29,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:29,375 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 96 flow [2023-08-27 03:52:29,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, 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-27 03:52:29,375 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-08-27 03:52:29,375 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 96 flow [2023-08-27 03:52:29,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:29,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:29,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:52:29,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:29,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1306379185, now seen corresponding path program 1 times [2023-08-27 03:52:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:29,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324398550] [2023-08-27 03:52:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324398550] [2023-08-27 03:52:29,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324398550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:29,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:29,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:52:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977547901] [2023-08-27 03:52:29,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:29,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:52:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:52:29,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:52:29,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:29,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:29,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:29,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:29,776 INFO L124 PetriNetUnfolderBase]: 2296/3694 cut-off events. [2023-08-27 03:52:29,777 INFO L125 PetriNetUnfolderBase]: For 384/417 co-relation queries the response was YES. [2023-08-27 03:52:29,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8921 conditions, 3694 events. 2296/3694 cut-off events. For 384/417 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21259 event pairs, 786 based on Foata normal form. 0/3173 useless extension candidates. Maximal degree in co-relation 8910. Up to 1946 conditions per place. [2023-08-27 03:52:29,795 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 44 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-08-27 03:52:29,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 271 flow [2023-08-27 03:52:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:52:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:52:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-08-27 03:52:29,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46996996996997 [2023-08-27 03:52:29,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-08-27 03:52:29,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-08-27 03:52:29,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:29,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-08-27 03:52:29,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,799 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 96 flow. Second operand 3 states and 313 transitions. [2023-08-27 03:52:29,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 271 flow [2023-08-27 03:52:29,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:52:29,800 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 146 flow [2023-08-27 03:52:29,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-08-27 03:52:29,801 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2023-08-27 03:52:29,801 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 146 flow [2023-08-27 03:52:29,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:29,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:29,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:29,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:52:29,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:29,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1843050410, now seen corresponding path program 1 times [2023-08-27 03:52:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498191973] [2023-08-27 03:52:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498191973] [2023-08-27 03:52:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498191973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:52:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899696398] [2023-08-27 03:52:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:29,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:29,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:29,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:29,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:29,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 146 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-27 03:52:29,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:30,230 INFO L124 PetriNetUnfolderBase]: 2251/3633 cut-off events. [2023-08-27 03:52:30,230 INFO L125 PetriNetUnfolderBase]: For 1856/1904 co-relation queries the response was YES. [2023-08-27 03:52:30,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 3633 events. 2251/3633 cut-off events. For 1856/1904 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20711 event pairs, 348 based on Foata normal form. 12/3243 useless extension candidates. Maximal degree in co-relation 10261. Up to 1758 conditions per place. [2023-08-27 03:52:30,245 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 55 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2023-08-27 03:52:30,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 402 flow [2023-08-27 03:52:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-08-27 03:52:30,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2023-08-27 03:52:30,246 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-08-27 03:52:30,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-08-27 03:52:30,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:30,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-08-27 03:52:30,247 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-27 03:52:30,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,249 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,249 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 146 flow. Second operand 4 states and 412 transitions. [2023-08-27 03:52:30,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 402 flow [2023-08-27 03:52:30,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:30,253 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 222 flow [2023-08-27 03:52:30,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2023-08-27 03:52:30,254 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-27 03:52:30,254 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 222 flow [2023-08-27 03:52:30,254 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-27 03:52:30,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:30,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:30,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:52:30,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:30,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1872637592, now seen corresponding path program 1 times [2023-08-27 03:52:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099552099] [2023-08-27 03:52:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099552099] [2023-08-27 03:52:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099552099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:52:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981819647] [2023-08-27 03:52:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:30,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:30,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 03:52:30,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:30,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 03:52:30,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:30,599 INFO L124 PetriNetUnfolderBase]: 1921/2971 cut-off events. [2023-08-27 03:52:30,600 INFO L125 PetriNetUnfolderBase]: For 3035/3155 co-relation queries the response was YES. [2023-08-27 03:52:30,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9013 conditions, 2971 events. 1921/2971 cut-off events. For 3035/3155 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15908 event pairs, 455 based on Foata normal form. 54/2669 useless extension candidates. Maximal degree in co-relation 8996. Up to 1981 conditions per place. [2023-08-27 03:52:30,619 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 49 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-27 03:52:30,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 404 flow [2023-08-27 03:52:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-27 03:52:30,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-27 03:52:30,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-27 03:52:30,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-27 03:52:30,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:30,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-27 03:52:30,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,623 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 222 flow. Second operand 4 states and 414 transitions. [2023-08-27 03:52:30,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 404 flow [2023-08-27 03:52:30,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 404 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:52:30,629 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 218 flow [2023-08-27 03:52:30,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-27 03:52:30,630 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-27 03:52:30,630 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 218 flow [2023-08-27 03:52:30,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:30,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:30,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:52:30,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:30,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1888713994, now seen corresponding path program 1 times [2023-08-27 03:52:30,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801742652] [2023-08-27 03:52:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801742652] [2023-08-27 03:52:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801742652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:52:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517343469] [2023-08-27 03:52:30,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:30,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:30,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:30,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 222 [2023-08-27 03:52:30,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:30,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:30,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 222 [2023-08-27 03:52:30,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:31,106 INFO L124 PetriNetUnfolderBase]: 2593/3997 cut-off events. [2023-08-27 03:52:31,106 INFO L125 PetriNetUnfolderBase]: For 4859/4859 co-relation queries the response was YES. [2023-08-27 03:52:31,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12848 conditions, 3997 events. 2593/3997 cut-off events. For 4859/4859 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20971 event pairs, 601 based on Foata normal form. 106/3703 useless extension candidates. Maximal degree in co-relation 12829. Up to 2387 conditions per place. [2023-08-27 03:52:31,123 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 64 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-08-27 03:52:31,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 490 flow [2023-08-27 03:52:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-27 03:52:31,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46734234234234234 [2023-08-27 03:52:31,125 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-27 03:52:31,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-27 03:52:31,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:31,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-27 03:52:31,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,129 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,129 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 218 flow. Second operand 4 states and 415 transitions. [2023-08-27 03:52:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 490 flow [2023-08-27 03:52:31,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:31,138 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 241 flow [2023-08-27 03:52:31,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-27 03:52:31,140 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-08-27 03:52:31,141 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 241 flow [2023-08-27 03:52:31,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:31,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:31,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:52:31,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:31,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1872637591, now seen corresponding path program 1 times [2023-08-27 03:52:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807237977] [2023-08-27 03:52:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:31,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:31,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807237977] [2023-08-27 03:52:31,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807237977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:31,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:52:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016422293] [2023-08-27 03:52:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:31,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:31,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 03:52:31,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:31,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 03:52:31,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:31,506 INFO L124 PetriNetUnfolderBase]: 1840/2843 cut-off events. [2023-08-27 03:52:31,506 INFO L125 PetriNetUnfolderBase]: For 3558/3722 co-relation queries the response was YES. [2023-08-27 03:52:31,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 2843 events. 1840/2843 cut-off events. For 3558/3722 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15360 event pairs, 443 based on Foata normal form. 84/2811 useless extension candidates. Maximal degree in co-relation 9174. Up to 1159 conditions per place. [2023-08-27 03:52:31,516 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 67 selfloop transitions, 7 changer transitions 0/82 dead transitions. [2023-08-27 03:52:31,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 581 flow [2023-08-27 03:52:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-27 03:52:31,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2023-08-27 03:52:31,518 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-27 03:52:31,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-27 03:52:31,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:31,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-27 03:52:31,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,520 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 241 flow. Second operand 4 states and 429 transitions. [2023-08-27 03:52:31,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 581 flow [2023-08-27 03:52:31,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:31,525 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 277 flow [2023-08-27 03:52:31,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-27 03:52:31,526 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-27 03:52:31,527 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 277 flow [2023-08-27 03:52:31,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:31,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:31,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:52:31,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:31,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1136166695, now seen corresponding path program 1 times [2023-08-27 03:52:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766754564] [2023-08-27 03:52:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766754564] [2023-08-27 03:52:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766754564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:52:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857484882] [2023-08-27 03:52:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:31,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:31,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:31,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:31,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:31,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:31,975 INFO L124 PetriNetUnfolderBase]: 2273/3511 cut-off events. [2023-08-27 03:52:31,975 INFO L125 PetriNetUnfolderBase]: For 6410/6410 co-relation queries the response was YES. [2023-08-27 03:52:31,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12872 conditions, 3511 events. 2273/3511 cut-off events. For 6410/6410 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18428 event pairs, 406 based on Foata normal form. 9/3463 useless extension candidates. Maximal degree in co-relation 12851. Up to 1583 conditions per place. [2023-08-27 03:52:31,990 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 68 selfloop transitions, 15 changer transitions 6/89 dead transitions. [2023-08-27 03:52:31,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 685 flow [2023-08-27 03:52:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-08-27 03:52:31,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47184684684684686 [2023-08-27 03:52:31,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-08-27 03:52:31,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-08-27 03:52:31,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:31,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-08-27 03:52:31,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,994 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:31,994 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 277 flow. Second operand 4 states and 419 transitions. [2023-08-27 03:52:31,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 685 flow [2023-08-27 03:52:32,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 647 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:32,002 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 355 flow [2023-08-27 03:52:32,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-27 03:52:32,003 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-08-27 03:52:32,004 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 355 flow [2023-08-27 03:52:32,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:32,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:32,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:52:32,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:32,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 851104646, now seen corresponding path program 1 times [2023-08-27 03:52:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114900896] [2023-08-27 03:52:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:32,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114900896] [2023-08-27 03:52:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114900896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:52:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554685301] [2023-08-27 03:52:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:32,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:32,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:32,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:32,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:32,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:32,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:32,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:32,469 INFO L124 PetriNetUnfolderBase]: 2252/3481 cut-off events. [2023-08-27 03:52:32,469 INFO L125 PetriNetUnfolderBase]: For 8138/8138 co-relation queries the response was YES. [2023-08-27 03:52:32,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 3481 events. 2252/3481 cut-off events. For 8138/8138 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18225 event pairs, 496 based on Foata normal form. 9/3433 useless extension candidates. Maximal degree in co-relation 13382. Up to 2000 conditions per place. [2023-08-27 03:52:32,486 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 69 selfloop transitions, 17 changer transitions 3/89 dead transitions. [2023-08-27 03:52:32,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 752 flow [2023-08-27 03:52:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:52:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:52:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-27 03:52:32,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2023-08-27 03:52:32,487 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-27 03:52:32,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-27 03:52:32,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:32,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-27 03:52:32,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,490 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,490 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 355 flow. Second operand 4 states and 414 transitions. [2023-08-27 03:52:32,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 752 flow [2023-08-27 03:52:32,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 750 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 03:52:32,501 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 481 flow [2023-08-27 03:52:32,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=481, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-08-27 03:52:32,501 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-08-27 03:52:32,501 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 481 flow [2023-08-27 03:52:32,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:32,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:32,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:52:32,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:32,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash 659134711, now seen corresponding path program 1 times [2023-08-27 03:52:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938105618] [2023-08-27 03:52:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938105618] [2023-08-27 03:52:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938105618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:52:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937666457] [2023-08-27 03:52:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:32,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:52:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:52:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:52:32,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:32,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:32,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:32,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:32,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:33,172 INFO L124 PetriNetUnfolderBase]: 3448/5409 cut-off events. [2023-08-27 03:52:33,173 INFO L125 PetriNetUnfolderBase]: For 19946/19946 co-relation queries the response was YES. [2023-08-27 03:52:33,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22425 conditions, 5409 events. 3448/5409 cut-off events. For 19946/19946 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31377 event pairs, 778 based on Foata normal form. 30/5328 useless extension candidates. Maximal degree in co-relation 22396. Up to 2675 conditions per place. [2023-08-27 03:52:33,199 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 86 selfloop transitions, 16 changer transitions 6/108 dead transitions. [2023-08-27 03:52:33,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 108 transitions, 1026 flow [2023-08-27 03:52:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:52:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:52:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-27 03:52:33,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2023-08-27 03:52:33,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-27 03:52:33,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-27 03:52:33,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:33,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-27 03:52:33,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:33,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:33,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:33,204 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 481 flow. Second operand 5 states and 516 transitions. [2023-08-27 03:52:33,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 108 transitions, 1026 flow [2023-08-27 03:52:33,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:52:33,225 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 656 flow [2023-08-27 03:52:33,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=656, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-08-27 03:52:33,226 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2023-08-27 03:52:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 656 flow [2023-08-27 03:52:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:33,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:33,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:33,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:52:33,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:33,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 614477041, now seen corresponding path program 2 times [2023-08-27 03:52:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82672851] [2023-08-27 03:52:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82672851] [2023-08-27 03:52:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82672851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:52:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669437149] [2023-08-27 03:52:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:33,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:52:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:33,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:52:33,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:52:33,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 03:52:33,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 656 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:33,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:33,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 03:52:33,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:33,997 INFO L124 PetriNetUnfolderBase]: 4048/6423 cut-off events. [2023-08-27 03:52:33,998 INFO L125 PetriNetUnfolderBase]: For 30759/30759 co-relation queries the response was YES. [2023-08-27 03:52:34,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27863 conditions, 6423 events. 4048/6423 cut-off events. For 30759/30759 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 39689 event pairs, 627 based on Foata normal form. 30/6297 useless extension candidates. Maximal degree in co-relation 27830. Up to 2264 conditions per place. [2023-08-27 03:52:34,035 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 105 selfloop transitions, 25 changer transitions 12/142 dead transitions. [2023-08-27 03:52:34,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1380 flow [2023-08-27 03:52:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:52:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:52:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2023-08-27 03:52:34,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692192192192192 [2023-08-27 03:52:34,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 625 transitions. [2023-08-27 03:52:34,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions. [2023-08-27 03:52:34,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:34,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions. [2023-08-27 03:52:34,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,040 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 656 flow. Second operand 6 states and 625 transitions. [2023-08-27 03:52:34,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1380 flow [2023-08-27 03:52:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 142 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:52:34,092 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 791 flow [2023-08-27 03:52:34,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-27 03:52:34,093 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2023-08-27 03:52:34,093 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 791 flow [2023-08-27 03:52:34,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:34,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:34,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:52:34,094 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:34,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash 614438911, now seen corresponding path program 3 times [2023-08-27 03:52:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787770715] [2023-08-27 03:52:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:34,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:34,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787770715] [2023-08-27 03:52:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787770715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:52:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430345024] [2023-08-27 03:52:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:34,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:52:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:52:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:52:34,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 222 [2023-08-27 03:52:34,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 791 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:34,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 222 [2023-08-27 03:52:34,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:34,892 INFO L124 PetriNetUnfolderBase]: 2638/4696 cut-off events. [2023-08-27 03:52:34,893 INFO L125 PetriNetUnfolderBase]: For 25407/25583 co-relation queries the response was YES. [2023-08-27 03:52:34,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19029 conditions, 4696 events. 2638/4696 cut-off events. For 25407/25583 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 33236 event pairs, 533 based on Foata normal form. 540/5018 useless extension candidates. Maximal degree in co-relation 18992. Up to 3257 conditions per place. [2023-08-27 03:52:34,919 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 94 selfloop transitions, 8 changer transitions 3/119 dead transitions. [2023-08-27 03:52:34,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1527 flow [2023-08-27 03:52:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:52:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:52:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-27 03:52:34,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46306306306306305 [2023-08-27 03:52:34,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-27 03:52:34,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-27 03:52:34,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:34,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-27 03:52:34,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,924 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 791 flow. Second operand 5 states and 514 transitions. [2023-08-27 03:52:34,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1527 flow [2023-08-27 03:52:34,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:52:34,951 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 837 flow [2023-08-27 03:52:34,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=837, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-08-27 03:52:34,952 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2023-08-27 03:52:34,952 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 837 flow [2023-08-27 03:52:34,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:34,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:34,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:34,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:52:34,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:34,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -6958205, now seen corresponding path program 1 times [2023-08-27 03:52:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469300033] [2023-08-27 03:52:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469300033] [2023-08-27 03:52:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469300033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:52:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977186718] [2023-08-27 03:52:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:35,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:52:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:52:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:52:35,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 222 [2023-08-27 03:52:35,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:35,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 222 [2023-08-27 03:52:35,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:35,508 INFO L124 PetriNetUnfolderBase]: 1804/3476 cut-off events. [2023-08-27 03:52:35,508 INFO L125 PetriNetUnfolderBase]: For 17242/17307 co-relation queries the response was YES. [2023-08-27 03:52:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14966 conditions, 3476 events. 1804/3476 cut-off events. For 17242/17307 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25544 event pairs, 273 based on Foata normal form. 326/3570 useless extension candidates. Maximal degree in co-relation 14924. Up to 1016 conditions per place. [2023-08-27 03:52:35,522 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 110 selfloop transitions, 15 changer transitions 3/142 dead transitions. [2023-08-27 03:52:35,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 142 transitions, 1810 flow [2023-08-27 03:52:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:52:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:52:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2023-08-27 03:52:35,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613899613899614 [2023-08-27 03:52:35,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2023-08-27 03:52:35,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2023-08-27 03:52:35,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:35,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2023-08-27 03:52:35,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,527 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 837 flow. Second operand 7 states and 717 transitions. [2023-08-27 03:52:35,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 142 transitions, 1810 flow [2023-08-27 03:52:35,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 1797 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:52:35,565 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 875 flow [2023-08-27 03:52:35,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=875, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2023-08-27 03:52:35,566 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2023-08-27 03:52:35,566 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 875 flow [2023-08-27 03:52:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:35,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:52:35,566 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:35,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash 912893270, now seen corresponding path program 1 times [2023-08-27 03:52:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465847902] [2023-08-27 03:52:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465847902] [2023-08-27 03:52:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465847902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:52:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680287555] [2023-08-27 03:52:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:35,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:52:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:52:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:52:35,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 03:52:35,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:35,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 03:52:35,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:35,939 INFO L124 PetriNetUnfolderBase]: 1703/3176 cut-off events. [2023-08-27 03:52:35,939 INFO L125 PetriNetUnfolderBase]: For 18118/18174 co-relation queries the response was YES. [2023-08-27 03:52:35,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15614 conditions, 3176 events. 1703/3176 cut-off events. For 18118/18174 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 22219 event pairs, 376 based on Foata normal form. 24/3145 useless extension candidates. Maximal degree in co-relation 15569. Up to 1174 conditions per place. [2023-08-27 03:52:35,948 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 28 selfloop transitions, 10 changer transitions 64/104 dead transitions. [2023-08-27 03:52:35,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 1437 flow [2023-08-27 03:52:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:52:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:52:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-08-27 03:52:35,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657657657657658 [2023-08-27 03:52:35,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-08-27 03:52:35,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-08-27 03:52:35,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:35,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-08-27 03:52:35,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,953 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:35,953 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 875 flow. Second operand 5 states and 517 transitions. [2023-08-27 03:52:35,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 1437 flow [2023-08-27 03:52:36,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 1410 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 03:52:36,028 INFO L231 Difference]: Finished difference. Result has 81 places, 26 transitions, 211 flow [2023-08-27 03:52:36,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=81, PETRI_TRANSITIONS=26} [2023-08-27 03:52:36,028 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2023-08-27 03:52:36,029 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 26 transitions, 211 flow [2023-08-27 03:52:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:36,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:52:36,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:36,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 56142210, now seen corresponding path program 1 times [2023-08-27 03:52:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399642905] [2023-08-27 03:52:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:36,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399642905] [2023-08-27 03:52:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399642905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:36,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:36,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:52:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137174571] [2023-08-27 03:52:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:36,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:52:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:52:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:52:36,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 222 [2023-08-27 03:52:36,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 26 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:36,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 222 [2023-08-27 03:52:36,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:36,606 INFO L124 PetriNetUnfolderBase]: 88/190 cut-off events. [2023-08-27 03:52:36,606 INFO L125 PetriNetUnfolderBase]: For 880/880 co-relation queries the response was YES. [2023-08-27 03:52:36,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 190 events. 88/190 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 602 event pairs, 11 based on Foata normal form. 5/195 useless extension candidates. Maximal degree in co-relation 897. Up to 110 conditions per place. [2023-08-27 03:52:36,607 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 32 selfloop transitions, 9 changer transitions 18/59 dead transitions. [2023-08-27 03:52:36,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 59 transitions, 560 flow [2023-08-27 03:52:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:52:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:52:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2023-08-27 03:52:36,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2023-08-27 03:52:36,610 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 703 transitions. [2023-08-27 03:52:36,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 703 transitions. [2023-08-27 03:52:36,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:36,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 703 transitions. [2023-08-27 03:52:36,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,614 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,614 INFO L175 Difference]: Start difference. First operand has 81 places, 26 transitions, 211 flow. Second operand 8 states and 703 transitions. [2023-08-27 03:52:36,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 59 transitions, 560 flow [2023-08-27 03:52:36,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 361 flow, removed 33 selfloop flow, removed 35 redundant places. [2023-08-27 03:52:36,615 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 159 flow [2023-08-27 03:52:36,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-27 03:52:36,616 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-27 03:52:36,616 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 159 flow [2023-08-27 03:52:36,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:36,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:52:36,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:36,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 541062660, now seen corresponding path program 1 times [2023-08-27 03:52:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:36,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90038495] [2023-08-27 03:52:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:36,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90038495] [2023-08-27 03:52:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90038495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:36,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:36,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:52:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968674692] [2023-08-27 03:52:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:36,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:52:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:52:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:52:36,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 222 [2023-08-27 03:52:36,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:36,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 222 [2023-08-27 03:52:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:36,805 INFO L124 PetriNetUnfolderBase]: 53/118 cut-off events. [2023-08-27 03:52:36,805 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-27 03:52:36,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 118 events. 53/118 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 301 event pairs, 7 based on Foata normal form. 8/125 useless extension candidates. Maximal degree in co-relation 443. Up to 39 conditions per place. [2023-08-27 03:52:36,805 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 31 selfloop transitions, 10 changer transitions 8/52 dead transitions. [2023-08-27 03:52:36,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 349 flow [2023-08-27 03:52:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:52:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:52:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-08-27 03:52:36,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43886743886743884 [2023-08-27 03:52:36,807 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-08-27 03:52:36,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-08-27 03:52:36,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:36,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-08-27 03:52:36,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,810 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,811 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 159 flow. Second operand 7 states and 682 transitions. [2023-08-27 03:52:36,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 349 flow [2023-08-27 03:52:36,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 322 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-27 03:52:36,812 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 173 flow [2023-08-27 03:52:36,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2023-08-27 03:52:36,812 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-08-27 03:52:36,812 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 173 flow [2023-08-27 03:52:36,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:36,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:36,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:36,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:52:36,813 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:36,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -376568634, now seen corresponding path program 1 times [2023-08-27 03:52:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255898400] [2023-08-27 03:52:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:52:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:52:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:52:37,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255898400] [2023-08-27 03:52:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255898400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:52:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:52:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:52:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71256887] [2023-08-27 03:52:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:52:37,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:52:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:52:37,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:52:37,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:52:37,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-27 03:52:37,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:37,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:52:37,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-27 03:52:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:52:37,281 INFO L124 PetriNetUnfolderBase]: 51/120 cut-off events. [2023-08-27 03:52:37,281 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2023-08-27 03:52:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 120 events. 51/120 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 309 event pairs, 10 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 490. Up to 66 conditions per place. [2023-08-27 03:52:37,282 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 29 selfloop transitions, 4 changer transitions 20/55 dead transitions. [2023-08-27 03:52:37,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 423 flow [2023-08-27 03:52:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:52:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:52:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 650 transitions. [2023-08-27 03:52:37,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41827541827541825 [2023-08-27 03:52:37,283 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 650 transitions. [2023-08-27 03:52:37,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 650 transitions. [2023-08-27 03:52:37,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:52:37,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 650 transitions. [2023-08-27 03:52:37,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:37,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:37,287 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:37,287 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 173 flow. Second operand 7 states and 650 transitions. [2023-08-27 03:52:37,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 423 flow [2023-08-27 03:52:37,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 369 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-27 03:52:37,288 INFO L231 Difference]: Finished difference. Result has 52 places, 28 transitions, 142 flow [2023-08-27 03:52:37,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=28} [2023-08-27 03:52:37,288 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-08-27 03:52:37,288 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 28 transitions, 142 flow [2023-08-27 03:52:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:52:37,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:52:37,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:37,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:52:37,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:52:37,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:52:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1729759198, now seen corresponding path program 2 times [2023-08-27 03:52:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:52:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598671411] [2023-08-27 03:52:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:52:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:52:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:52:37,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:52:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:52:37,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:52:37,381 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:52:37,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:52:37,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:52:37,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:52:37,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:52:37,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:52:37,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:52:37,384 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:52:37,388 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:52:37,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:52:37,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:52:37 BasicIcfg [2023-08-27 03:52:37,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:52:37,439 INFO L158 Benchmark]: Toolchain (without parser) took 13242.80ms. Allocated memory was 348.1MB in the beginning and 1.1GB in the end (delta: 759.2MB). Free memory was 319.1MB in the beginning and 729.3MB in the end (delta: -410.1MB). Peak memory consumption was 349.5MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,439 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory is still 324.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:52:37,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.30ms. Allocated memory is still 348.1MB. Free memory was 319.1MB in the beginning and 296.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 348.1MB. Free memory was 296.1MB in the beginning and 294.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,440 INFO L158 Benchmark]: Boogie Preprocessor took 26.56ms. Allocated memory is still 348.1MB. Free memory was 294.0MB in the beginning and 291.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,440 INFO L158 Benchmark]: RCFGBuilder took 477.66ms. Allocated memory is still 348.1MB. Free memory was 291.9MB in the beginning and 305.9MB in the end (delta: -14.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,440 INFO L158 Benchmark]: TraceAbstraction took 12301.68ms. Allocated memory was 348.1MB in the beginning and 1.1GB in the end (delta: 759.2MB). Free memory was 305.1MB in the beginning and 729.3MB in the end (delta: -424.2MB). Peak memory consumption was 334.6MB. Max. memory is 16.0GB. [2023-08-27 03:52:37,443 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 348.1MB. Free memory is still 324.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 381.30ms. Allocated memory is still 348.1MB. Free memory was 319.1MB in the beginning and 296.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 348.1MB. Free memory was 296.1MB in the beginning and 294.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.56ms. Allocated memory is still 348.1MB. Free memory was 294.0MB in the beginning and 291.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 477.66ms. Allocated memory is still 348.1MB. Free memory was 291.9MB in the beginning and 305.9MB in the end (delta: -14.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. * TraceAbstraction took 12301.68ms. Allocated memory was 348.1MB in the beginning and 1.1GB in the end (delta: 759.2MB). Free memory was 305.1MB in the beginning and 729.3MB in the end (delta: -424.2MB). Peak memory consumption was 334.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 121 PlacesBefore, 38 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 9127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3110, independent: 2839, independent conditional: 0, independent unconditional: 2839, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1423, independent: 1382, independent conditional: 0, independent unconditional: 1382, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3110, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 1423, unknown conditional: 0, unknown unconditional: 1423] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-1, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=0, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=1, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] EXPR 2 __unbuffered_cnt + 1 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] EXPR 3 __unbuffered_cnt + 1 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] EXPR 1 __unbuffered_cnt + 1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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: 12.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1356 IncrementalHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 23 mSDtfsCounter, 1356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=13, InterpolantAutomatonStates: 83, 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, 2.0s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:52:37,462 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...