/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 22:12:51,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 22:12:51,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 22:12:51,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 22:12:51,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 22:12:51,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 22:12:51,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 22:12:51,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 22:12:51,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 22:12:51,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 22:12:51,945 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 22:12:51,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 22:12:51,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 22:12:51,946 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 22:12:51,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 22:12:51,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 22:12:51,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 22:12:51,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 22:12:51,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 22:12:51,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 22:12:51,948 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 22:12:51,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 22:12:51,949 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 22:12:51,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 22:12:51,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 22:12:51,950 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 22:12:51,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 22:12:51,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 22:12:51,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 22:12:51,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 22:12:51,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 22:12:51,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 22:12:51,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 22:12:51,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 22:12:51,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 22:12:51,952 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 22:12:52,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 22:12:52,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 22:12:52,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 22:12:52,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 22:12:52,289 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 22:12:52,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-26 22:12:53,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 22:12:53,723 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 22:12:53,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-26 22:12:53,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056e3216e/87812fe8daf94ad28469467b2f63361b/FLAG8f9af6c7a [2023-08-26 22:12:53,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056e3216e/87812fe8daf94ad28469467b2f63361b [2023-08-26 22:12:53,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 22:12:53,765 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 22:12:53,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 22:12:53,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 22:12:53,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 22:12:53,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:12:53" (1/1) ... [2023-08-26 22:12:53,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2296072e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:53, skipping insertion in model container [2023-08-26 22:12:53,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:12:53" (1/1) ... [2023-08-26 22:12:53,817 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 22:12:54,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 22:12:54,196 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 22:12:54,221 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 22:12:54,223 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 22:12:54,229 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 22:12:54,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 22:12:54,320 INFO L206 MainTranslator]: Completed translation [2023-08-26 22:12:54,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54 WrapperNode [2023-08-26 22:12:54,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 22:12:54,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 22:12:54,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 22:12:54,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 22:12:54,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,386 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2023-08-26 22:12:54,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 22:12:54,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 22:12:54,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 22:12:54,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 22:12:54,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 22:12:54,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 22:12:54,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 22:12:54,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 22:12:54,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (1/1) ... [2023-08-26 22:12:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 22:12:54,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:12:54,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 22:12:54,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 22:12:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 22:12:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 22:12:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 22:12:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 22:12:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 22:12:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 22:12:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 22:12:54,508 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 22:12:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 22:12:54,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 22:12:54,510 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 22:12:54,677 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 22:12:54,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 22:12:54,893 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 22:12:54,901 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 22:12:54,901 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-26 22:12:54,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:12:54 BoogieIcfgContainer [2023-08-26 22:12:54,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 22:12:54,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 22:12:54,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 22:12:54,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 22:12:54,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:12:53" (1/3) ... [2023-08-26 22:12:54,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10404db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:12:54, skipping insertion in model container [2023-08-26 22:12:54,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:54" (2/3) ... [2023-08-26 22:12:54,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10404db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:12:54, skipping insertion in model container [2023-08-26 22:12:54,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:12:54" (3/3) ... [2023-08-26 22:12:54,915 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-08-26 22:12:54,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 22:12:54,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 22:12:54,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 22:12:55,025 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 22:12:55,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 93 transitions, 191 flow [2023-08-26 22:12:55,120 INFO L124 PetriNetUnfolderBase]: 6/92 cut-off events. [2023-08-26 22:12:55,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 92 events. 6/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-26 22:12:55,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 93 transitions, 191 flow [2023-08-26 22:12:55,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 187 flow [2023-08-26 22:12:55,134 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 22:12:55,141 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 92 transitions, 187 flow [2023-08-26 22:12:55,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 92 transitions, 187 flow [2023-08-26 22:12:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 187 flow [2023-08-26 22:12:55,159 INFO L124 PetriNetUnfolderBase]: 6/92 cut-off events. [2023-08-26 22:12:55,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 92 events. 6/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-26 22:12:55,162 INFO L119 LiptonReduction]: Number of co-enabled transitions 2108 [2023-08-26 22:12:57,016 INFO L134 LiptonReduction]: Checked pairs total: 2651 [2023-08-26 22:12:57,016 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-26 22:12:57,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 22:12:57,044 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;@ba9a989, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 22:12:57,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 22:12:57,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 22:12:57,048 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-26 22:12:57,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:57,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:57,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 22:12:57,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:57,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 11586, now seen corresponding path program 1 times [2023-08-26 22:12:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:57,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704098383] [2023-08-26 22:12:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704098383] [2023-08-26 22:12:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704098383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:12:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 22:12:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69619194] [2023-08-26 22:12:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:57,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:12:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:12:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:12:57,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:12:57,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:57,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:12:57,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:57,392 INFO L124 PetriNetUnfolderBase]: 102/204 cut-off events. [2023-08-26 22:12:57,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:57,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 204 events. 102/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 720 event pairs, 81 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 400. Up to 203 conditions per place. [2023-08-26 22:12:57,395 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-26 22:12:57,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 99 flow [2023-08-26 22:12:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:12:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:12:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-26 22:12:57,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2023-08-26 22:12:57,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:57,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,426 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 269 transitions. [2023-08-26 22:12:57,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 99 flow [2023-08-26 22:12:57,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:12:57,429 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 54 flow [2023-08-26 22:12:57,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2023-08-26 22:12:57,435 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-26 22:12:57,435 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 54 flow [2023-08-26 22:12:57,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:57,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 22:12:57,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 22:12:57,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:57,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2147196239, now seen corresponding path program 1 times [2023-08-26 22:12:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655938490] [2023-08-26 22:12:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655938490] [2023-08-26 22:12:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655938490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:12:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:12:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282474244] [2023-08-26 22:12:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:57,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:12:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:12:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:12:57,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:12:57,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:57,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:12:57,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:57,591 INFO L124 PetriNetUnfolderBase]: 102/205 cut-off events. [2023-08-26 22:12:57,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:57,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 205 events. 102/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 720 event pairs, 81 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 404. Up to 205 conditions per place. [2023-08-26 22:12:57,593 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-26 22:12:57,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 106 flow [2023-08-26 22:12:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:12:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:12:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-26 22:12:57,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2023-08-26 22:12:57,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:57,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-26 22:12:57,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,600 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 54 flow. Second operand 3 states and 269 transitions. [2023-08-26 22:12:57,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 106 flow [2023-08-26 22:12:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 22:12:57,601 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 62 flow [2023-08-26 22:12:57,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-08-26 22:12:57,602 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2023-08-26 22:12:57,602 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 62 flow [2023-08-26 22:12:57,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:57,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 22:12:57,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:57,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2073968638, now seen corresponding path program 1 times [2023-08-26 22:12:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025611525] [2023-08-26 22:12:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025611525] [2023-08-26 22:12:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025611525] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:12:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518489733] [2023-08-26 22:12:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:12:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:12:57,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:12:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 22:12:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:57,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 22:12:57,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:12:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:57,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:12:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:57,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518489733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:12:57,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:12:57,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 22:12:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796589061] [2023-08-26 22:12:57,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:12:57,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 22:12:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 22:12:57,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 22:12:57,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:12:57,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:57,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:12:57,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:57,976 INFO L124 PetriNetUnfolderBase]: 102/208 cut-off events. [2023-08-26 22:12:57,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 22:12:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 208 events. 102/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 719 event pairs, 81 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 419. Up to 205 conditions per place. [2023-08-26 22:12:57,978 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-26 22:12:57,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 130 flow [2023-08-26 22:12:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 22:12:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 22:12:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-26 22:12:57,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787037037037037 [2023-08-26 22:12:57,988 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-26 22:12:57,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-26 22:12:57,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:57,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-26 22:12:57,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 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-26 22:12:57,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,994 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,995 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 6 states and 517 transitions. [2023-08-26 22:12:57,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 130 flow [2023-08-26 22:12:57,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 22:12:57,996 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 94 flow [2023-08-26 22:12:57,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-26 22:12:57,998 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-26 22:12:57,998 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 94 flow [2023-08-26 22:12:57,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:57,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:57,999 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:58,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 22:12:58,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:12:58,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:58,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1528409841, now seen corresponding path program 2 times [2023-08-26 22:12:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026164835] [2023-08-26 22:12:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026164835] [2023-08-26 22:12:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026164835] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:12:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312125315] [2023-08-26 22:12:58,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 22:12:58,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:12:58,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:12:58,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:12:58,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 22:12:58,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 22:12:58,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:12:58,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 22:12:58,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:12:58,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:12:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:12:58,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:12:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 22:12:58,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 22:12:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312125315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 22:12:58,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-26 22:12:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268637305] [2023-08-26 22:12:58,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:58,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 22:12:58,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:58,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 22:12:58,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 22:12:58,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-26 22:12:58,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:58,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:58,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-26 22:12:58,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:58,615 INFO L124 PetriNetUnfolderBase]: 136/276 cut-off events. [2023-08-26 22:12:58,616 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 22:12:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1070 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 546. Up to 211 conditions per place. [2023-08-26 22:12:58,620 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-26 22:12:58,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 226 flow [2023-08-26 22:12:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 22:12:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 22:12:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2023-08-26 22:12:58,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46805555555555556 [2023-08-26 22:12:58,622 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2023-08-26 22:12:58,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2023-08-26 22:12:58,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:58,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2023-08-26 22:12:58,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:58,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:58,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:58,625 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 94 flow. Second operand 4 states and 337 transitions. [2023-08-26 22:12:58,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 226 flow [2023-08-26 22:12:58,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 212 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 22:12:58,627 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 114 flow [2023-08-26 22:12:58,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-26 22:12:58,629 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2023-08-26 22:12:58,629 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 114 flow [2023-08-26 22:12:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:58,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:58,632 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:58,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 22:12:58,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-26 22:12:58,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:58,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1528420368, now seen corresponding path program 1 times [2023-08-26 22:12:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867560765] [2023-08-26 22:12:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867560765] [2023-08-26 22:12:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867560765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:12:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692164046] [2023-08-26 22:12:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:58,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:12:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:12:58,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:12:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 22:12:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:59,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 22:12:59,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:12:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:59,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:12:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 22:12:59,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692164046] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:12:59,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:12:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 22:12:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420732396] [2023-08-26 22:12:59,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:12:59,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 22:12:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 22:12:59,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 22:12:59,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:12:59,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 114 flow. Second operand has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:59,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:12:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:59,205 INFO L124 PetriNetUnfolderBase]: 136/282 cut-off events. [2023-08-26 22:12:59,205 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-26 22:12:59,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1094 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 634. Up to 273 conditions per place. [2023-08-26 22:12:59,207 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-26 22:12:59,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 226 flow [2023-08-26 22:12:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 22:12:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 22:12:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2023-08-26 22:12:59,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685185185185185 [2023-08-26 22:12:59,210 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1012 transitions. [2023-08-26 22:12:59,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1012 transitions. [2023-08-26 22:12:59,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:59,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1012 transitions. [2023-08-26 22:12:59,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,220 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,220 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 114 flow. Second operand 12 states and 1012 transitions. [2023-08-26 22:12:59,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 226 flow [2023-08-26 22:12:59,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 22:12:59,222 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 198 flow [2023-08-26 22:12:59,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-08-26 22:12:59,223 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-08-26 22:12:59,223 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 198 flow [2023-08-26 22:12:59,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:59,224 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:59,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 22:12:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:12:59,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:59,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:59,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2128703888, now seen corresponding path program 2 times [2023-08-26 22:12:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444294665] [2023-08-26 22:12:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:12:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:59,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444294665] [2023-08-26 22:12:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444294665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:12:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 22:12:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612336958] [2023-08-26 22:12:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:59,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 22:12:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 22:12:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 22:12:59,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-26 22:12:59,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:59,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-26 22:12:59,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:59,758 INFO L124 PetriNetUnfolderBase]: 126/262 cut-off events. [2023-08-26 22:12:59,758 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-26 22:12:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 262 events. 126/262 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 972 event pairs, 34 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 592. Up to 209 conditions per place. [2023-08-26 22:12:59,760 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-08-26 22:12:59,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 329 flow [2023-08-26 22:12:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 22:12:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 22:12:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-08-26 22:12:59,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2023-08-26 22:12:59,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-08-26 22:12:59,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-08-26 22:12:59,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:59,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-08-26 22:12:59,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,764 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 198 flow. Second operand 4 states and 333 transitions. [2023-08-26 22:12:59,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 329 flow [2023-08-26 22:12:59,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 281 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 22:12:59,768 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 182 flow [2023-08-26 22:12:59,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-26 22:12:59,769 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-08-26 22:12:59,769 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 182 flow [2023-08-26 22:12:59,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:59,769 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 22:12:59,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:59,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1290071975, now seen corresponding path program 1 times [2023-08-26 22:12:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466091457] [2023-08-26 22:12:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:12:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:59,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466091457] [2023-08-26 22:12:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466091457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:12:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:12:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632375629] [2023-08-26 22:12:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:12:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:12:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:12:59,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-26 22:12:59,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:59,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-26 22:12:59,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:12:59,902 INFO L124 PetriNetUnfolderBase]: 176/362 cut-off events. [2023-08-26 22:12:59,902 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-26 22:12:59,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 362 events. 176/362 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1487 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 906. Up to 219 conditions per place. [2023-08-26 22:12:59,906 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-26 22:12:59,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 360 flow [2023-08-26 22:12:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:12:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:12:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-08-26 22:12:59,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351851851851852 [2023-08-26 22:12:59,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-08-26 22:12:59,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-08-26 22:12:59,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:12:59,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-08-26 22:12:59,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,910 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 182 flow. Second operand 3 states and 289 transitions. [2023-08-26 22:12:59,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 360 flow [2023-08-26 22:12:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:12:59,912 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 193 flow [2023-08-26 22:12:59,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-26 22:12:59,913 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2023-08-26 22:12:59,913 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 193 flow [2023-08-26 22:12:59,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:12:59,914 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:12:59,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 22:12:59,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:12:59,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:12:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1279986895, now seen corresponding path program 1 times [2023-08-26 22:12:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:12:59,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862254043] [2023-08-26 22:12:59,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:12:59,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:12:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:12:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:12:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:12:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862254043] [2023-08-26 22:12:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862254043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:12:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:12:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:12:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145274026] [2023-08-26 22:12:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:12:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:12:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:12:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:12:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:12:59,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:12:59,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:12:59,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:12:59,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:12:59,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:00,064 INFO L124 PetriNetUnfolderBase]: 238/486 cut-off events. [2023-08-26 22:13:00,064 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-08-26 22:13:00,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 486 events. 238/486 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2028 event pairs, 118 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1318. Up to 333 conditions per place. [2023-08-26 22:13:00,068 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-26 22:13:00,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 390 flow [2023-08-26 22:13:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:13:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:13:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-26 22:13:00,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2023-08-26 22:13:00,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-26 22:13:00,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-26 22:13:00,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:00,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-26 22:13:00,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,072 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 193 flow. Second operand 3 states and 286 transitions. [2023-08-26 22:13:00,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 390 flow [2023-08-26 22:13:00,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:13:00,075 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 207 flow [2023-08-26 22:13:00,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-26 22:13:00,075 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 32 predicate places. [2023-08-26 22:13:00,076 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 207 flow [2023-08-26 22:13:00,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:00,076 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:00,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 22:13:00,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:00,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1445015532, now seen corresponding path program 1 times [2023-08-26 22:13:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:00,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923800832] [2023-08-26 22:13:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923800832] [2023-08-26 22:13:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923800832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792227951] [2023-08-26 22:13:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:00,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:00,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:00,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:00,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:00,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:00,708 INFO L124 PetriNetUnfolderBase]: 263/549 cut-off events. [2023-08-26 22:13:00,708 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2023-08-26 22:13:00,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 549 events. 263/549 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2439 event pairs, 109 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 1598. Up to 430 conditions per place. [2023-08-26 22:13:00,712 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 57 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2023-08-26 22:13:00,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 475 flow [2023-08-26 22:13:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 22:13:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 22:13:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2023-08-26 22:13:00,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2023-08-26 22:13:00,714 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 565 transitions. [2023-08-26 22:13:00,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 565 transitions. [2023-08-26 22:13:00,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:00,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 565 transitions. [2023-08-26 22:13:00,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.625) internal successors, (565), 8 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,720 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,720 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 207 flow. Second operand 8 states and 565 transitions. [2023-08-26 22:13:00,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 475 flow [2023-08-26 22:13:00,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:13:00,724 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 328 flow [2023-08-26 22:13:00,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-08-26 22:13:00,725 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2023-08-26 22:13:00,725 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 328 flow [2023-08-26 22:13:00,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:00,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:00,726 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:00,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 22:13:00,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:00,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1991927113, now seen corresponding path program 1 times [2023-08-26 22:13:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192916494] [2023-08-26 22:13:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192916494] [2023-08-26 22:13:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192916494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660664186] [2023-08-26 22:13:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:01,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:01,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:01,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:01,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:01,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:01,309 INFO L124 PetriNetUnfolderBase]: 284/604 cut-off events. [2023-08-26 22:13:01,309 INFO L125 PetriNetUnfolderBase]: For 822/822 co-relation queries the response was YES. [2023-08-26 22:13:01,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 604 events. 284/604 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2804 event pairs, 97 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 2043. Up to 479 conditions per place. [2023-08-26 22:13:01,314 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2023-08-26 22:13:01,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 652 flow [2023-08-26 22:13:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 22:13:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 22:13:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2023-08-26 22:13:01,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2023-08-26 22:13:01,316 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 565 transitions. [2023-08-26 22:13:01,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 565 transitions. [2023-08-26 22:13:01,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:01,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 565 transitions. [2023-08-26 22:13:01,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.625) internal successors, (565), 8 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,320 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,320 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 328 flow. Second operand 8 states and 565 transitions. [2023-08-26 22:13:01,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 652 flow [2023-08-26 22:13:01,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 635 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 22:13:01,325 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 468 flow [2023-08-26 22:13:01,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=468, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-08-26 22:13:01,326 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 53 predicate places. [2023-08-26 22:13:01,326 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 468 flow [2023-08-26 22:13:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:01,326 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 22:13:01,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:01,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1133449656, now seen corresponding path program 2 times [2023-08-26 22:13:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086006334] [2023-08-26 22:13:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:01,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086006334] [2023-08-26 22:13:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086006334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440681468] [2023-08-26 22:13:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:01,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:01,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:01,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 468 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:01,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:01,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:01,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:01,993 INFO L124 PetriNetUnfolderBase]: 310/649 cut-off events. [2023-08-26 22:13:01,993 INFO L125 PetriNetUnfolderBase]: For 1551/1551 co-relation queries the response was YES. [2023-08-26 22:13:01,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 649 events. 310/649 cut-off events. For 1551/1551 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3080 event pairs, 122 based on Foata normal form. 8/585 useless extension candidates. Maximal degree in co-relation 2545. Up to 488 conditions per place. [2023-08-26 22:13:01,998 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 67 selfloop transitions, 32 changer transitions 0/99 dead transitions. [2023-08-26 22:13:01,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 900 flow [2023-08-26 22:13:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 22:13:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 22:13:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 759 transitions. [2023-08-26 22:13:02,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2023-08-26 22:13:02,002 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 759 transitions. [2023-08-26 22:13:02,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 759 transitions. [2023-08-26 22:13:02,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:02,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 759 transitions. [2023-08-26 22:13:02,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,007 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,007 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 468 flow. Second operand 11 states and 759 transitions. [2023-08-26 22:13:02,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 900 flow [2023-08-26 22:13:02,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 99 transitions, 860 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 22:13:02,014 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 674 flow [2023-08-26 22:13:02,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=674, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-08-26 22:13:02,014 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 65 predicate places. [2023-08-26 22:13:02,015 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 674 flow [2023-08-26 22:13:02,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:02,015 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 22:13:02,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:02,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1134285727, now seen corresponding path program 1 times [2023-08-26 22:13:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617309061] [2023-08-26 22:13:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617309061] [2023-08-26 22:13:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617309061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730588097] [2023-08-26 22:13:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:02,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:02,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:02,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 674 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:02,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:02,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:02,588 INFO L124 PetriNetUnfolderBase]: 381/813 cut-off events. [2023-08-26 22:13:02,588 INFO L125 PetriNetUnfolderBase]: For 2795/2795 co-relation queries the response was YES. [2023-08-26 22:13:02,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 813 events. 381/813 cut-off events. For 2795/2795 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4306 event pairs, 74 based on Foata normal form. 7/712 useless extension candidates. Maximal degree in co-relation 3482. Up to 439 conditions per place. [2023-08-26 22:13:02,596 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 78 selfloop transitions, 39 changer transitions 0/117 dead transitions. [2023-08-26 22:13:02,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 117 transitions, 1163 flow [2023-08-26 22:13:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 22:13:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 22:13:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 836 transitions. [2023-08-26 22:13:02,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387037037037037 [2023-08-26 22:13:02,599 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 836 transitions. [2023-08-26 22:13:02,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 836 transitions. [2023-08-26 22:13:02,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:02,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 836 transitions. [2023-08-26 22:13:02,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,605 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,606 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 674 flow. Second operand 12 states and 836 transitions. [2023-08-26 22:13:02,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 117 transitions, 1163 flow [2023-08-26 22:13:02,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 1104 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-26 22:13:02,617 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 878 flow [2023-08-26 22:13:02,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=878, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2023-08-26 22:13:02,617 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2023-08-26 22:13:02,618 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 878 flow [2023-08-26 22:13:02,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:02,618 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:02,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 22:13:02,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:02,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1133417107, now seen corresponding path program 2 times [2023-08-26 22:13:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310868890] [2023-08-26 22:13:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:02,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310868890] [2023-08-26 22:13:02,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310868890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:02,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:02,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:02,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968907186] [2023-08-26 22:13:02,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:02,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:02,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:02,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:02,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:02,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:02,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:02,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:02,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:03,206 INFO L124 PetriNetUnfolderBase]: 423/908 cut-off events. [2023-08-26 22:13:03,206 INFO L125 PetriNetUnfolderBase]: For 4838/4838 co-relation queries the response was YES. [2023-08-26 22:13:03,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 908 events. 423/908 cut-off events. For 4838/4838 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4883 event pairs, 48 based on Foata normal form. 29/829 useless extension candidates. Maximal degree in co-relation 4360. Up to 379 conditions per place. [2023-08-26 22:13:03,214 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 85 selfloop transitions, 49 changer transitions 0/134 dead transitions. [2023-08-26 22:13:03,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 134 transitions, 1449 flow [2023-08-26 22:13:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 22:13:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 22:13:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 776 transitions. [2023-08-26 22:13:03,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39191919191919194 [2023-08-26 22:13:03,217 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 776 transitions. [2023-08-26 22:13:03,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 776 transitions. [2023-08-26 22:13:03,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:03,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 776 transitions. [2023-08-26 22:13:03,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.54545454545455) internal successors, (776), 11 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,222 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,223 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 878 flow. Second operand 11 states and 776 transitions. [2023-08-26 22:13:03,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 134 transitions, 1449 flow [2023-08-26 22:13:03,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 134 transitions, 1317 flow, removed 33 selfloop flow, removed 8 redundant places. [2023-08-26 22:13:03,240 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 999 flow [2023-08-26 22:13:03,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=999, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2023-08-26 22:13:03,240 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 81 predicate places. [2023-08-26 22:13:03,241 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 999 flow [2023-08-26 22:13:03,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:03,241 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 22:13:03,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:03,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1133417106, now seen corresponding path program 3 times [2023-08-26 22:13:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470513676] [2023-08-26 22:13:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470513676] [2023-08-26 22:13:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470513676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687033469] [2023-08-26 22:13:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:03,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:03,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:03,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:03,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:03,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:03,836 INFO L124 PetriNetUnfolderBase]: 416/894 cut-off events. [2023-08-26 22:13:03,837 INFO L125 PetriNetUnfolderBase]: For 5412/5412 co-relation queries the response was YES. [2023-08-26 22:13:03,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 894 events. 416/894 cut-off events. For 5412/5412 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4801 event pairs, 120 based on Foata normal form. 7/793 useless extension candidates. Maximal degree in co-relation 4460. Up to 693 conditions per place. [2023-08-26 22:13:03,846 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 87 selfloop transitions, 42 changer transitions 0/129 dead transitions. [2023-08-26 22:13:03,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 129 transitions, 1502 flow [2023-08-26 22:13:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 22:13:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 22:13:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2023-08-26 22:13:03,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38686868686868686 [2023-08-26 22:13:03,849 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 766 transitions. [2023-08-26 22:13:03,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 766 transitions. [2023-08-26 22:13:03,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:03,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 766 transitions. [2023-08-26 22:13:03,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.63636363636364) internal successors, (766), 11 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,854 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,854 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 999 flow. Second operand 11 states and 766 transitions. [2023-08-26 22:13:03,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 129 transitions, 1502 flow [2023-08-26 22:13:03,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 129 transitions, 1461 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-26 22:13:03,872 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 1125 flow [2023-08-26 22:13:03,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1125, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2023-08-26 22:13:03,873 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2023-08-26 22:13:03,873 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 1125 flow [2023-08-26 22:13:03,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:03,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:03,873 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:03,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 22:13:03,874 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:03,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1134241847, now seen corresponding path program 1 times [2023-08-26 22:13:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176176692] [2023-08-26 22:13:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176176692] [2023-08-26 22:13:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176176692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 22:13:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009090555] [2023-08-26 22:13:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:04,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 22:13:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 22:13:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 22:13:04,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-26 22:13:04,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 1125 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:04,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-26 22:13:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:04,395 INFO L124 PetriNetUnfolderBase]: 455/962 cut-off events. [2023-08-26 22:13:04,395 INFO L125 PetriNetUnfolderBase]: For 6474/6474 co-relation queries the response was YES. [2023-08-26 22:13:04,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 962 events. 455/962 cut-off events. For 6474/6474 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5218 event pairs, 190 based on Foata normal form. 21/871 useless extension candidates. Maximal degree in co-relation 4963. Up to 739 conditions per place. [2023-08-26 22:13:04,405 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 104 selfloop transitions, 28 changer transitions 0/132 dead transitions. [2023-08-26 22:13:04,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 1776 flow [2023-08-26 22:13:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 22:13:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 22:13:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 543 transitions. [2023-08-26 22:13:04,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2023-08-26 22:13:04,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 543 transitions. [2023-08-26 22:13:04,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 543 transitions. [2023-08-26 22:13:04,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:04,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 543 transitions. [2023-08-26 22:13:04,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,412 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,412 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 1125 flow. Second operand 7 states and 543 transitions. [2023-08-26 22:13:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 1776 flow [2023-08-26 22:13:04,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 1711 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-26 22:13:04,436 INFO L231 Difference]: Finished difference. Result has 114 places, 103 transitions, 1263 flow [2023-08-26 22:13:04,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1263, PETRI_PLACES=114, PETRI_TRANSITIONS=103} [2023-08-26 22:13:04,437 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 87 predicate places. [2023-08-26 22:13:04,437 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 103 transitions, 1263 flow [2023-08-26 22:13:04,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:04,438 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:04,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 22:13:04,438 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:04,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1131133815, now seen corresponding path program 2 times [2023-08-26 22:13:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598374296] [2023-08-26 22:13:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598374296] [2023-08-26 22:13:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598374296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 22:13:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913050260] [2023-08-26 22:13:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:04,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 22:13:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 22:13:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 22:13:04,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-26 22:13:04,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 1263 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:04,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:04,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-26 22:13:04,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:05,113 INFO L124 PetriNetUnfolderBase]: 443/944 cut-off events. [2023-08-26 22:13:05,114 INFO L125 PetriNetUnfolderBase]: For 7358/7358 co-relation queries the response was YES. [2023-08-26 22:13:05,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 944 events. 443/944 cut-off events. For 7358/7358 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5171 event pairs, 140 based on Foata normal form. 12/844 useless extension candidates. Maximal degree in co-relation 5053. Up to 735 conditions per place. [2023-08-26 22:13:05,123 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 98 selfloop transitions, 41 changer transitions 0/139 dead transitions. [2023-08-26 22:13:05,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 139 transitions, 1805 flow [2023-08-26 22:13:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 22:13:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 22:13:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 765 transitions. [2023-08-26 22:13:05,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2023-08-26 22:13:05,127 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 765 transitions. [2023-08-26 22:13:05,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 765 transitions. [2023-08-26 22:13:05,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:05,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 765 transitions. [2023-08-26 22:13:05,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.54545454545455) internal successors, (765), 11 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,137 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,137 INFO L175 Difference]: Start difference. First operand has 114 places, 103 transitions, 1263 flow. Second operand 11 states and 765 transitions. [2023-08-26 22:13:05,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 139 transitions, 1805 flow [2023-08-26 22:13:05,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 1779 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 22:13:05,157 INFO L231 Difference]: Finished difference. Result has 126 places, 110 transitions, 1460 flow [2023-08-26 22:13:05,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1460, PETRI_PLACES=126, PETRI_TRANSITIONS=110} [2023-08-26 22:13:05,158 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 99 predicate places. [2023-08-26 22:13:05,159 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 1460 flow [2023-08-26 22:13:05,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:05,159 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:05,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 22:13:05,160 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:05,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1131133787, now seen corresponding path program 2 times [2023-08-26 22:13:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301918062] [2023-08-26 22:13:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301918062] [2023-08-26 22:13:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301918062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:13:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:13:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 22:13:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542577545] [2023-08-26 22:13:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:13:05,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 22:13:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:05,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 22:13:05,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 22:13:05,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-26 22:13:05,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 1460 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:05,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-26 22:13:05,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:05,687 INFO L124 PetriNetUnfolderBase]: 464/977 cut-off events. [2023-08-26 22:13:05,687 INFO L125 PetriNetUnfolderBase]: For 9166/9166 co-relation queries the response was YES. [2023-08-26 22:13:05,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5779 conditions, 977 events. 464/977 cut-off events. For 9166/9166 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5316 event pairs, 156 based on Foata normal form. 15/876 useless extension candidates. Maximal degree in co-relation 5686. Up to 694 conditions per place. [2023-08-26 22:13:05,697 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 106 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2023-08-26 22:13:05,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 145 transitions, 2083 flow [2023-08-26 22:13:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 22:13:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 22:13:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2023-08-26 22:13:05,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271604938271605 [2023-08-26 22:13:05,700 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 692 transitions. [2023-08-26 22:13:05,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 692 transitions. [2023-08-26 22:13:05,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:13:05,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 692 transitions. [2023-08-26 22:13:05,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.88888888888889) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,705 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,705 INFO L175 Difference]: Start difference. First operand has 126 places, 110 transitions, 1460 flow. Second operand 9 states and 692 transitions. [2023-08-26 22:13:05,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 145 transitions, 2083 flow [2023-08-26 22:13:05,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 145 transitions, 1981 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 22:13:05,731 INFO L231 Difference]: Finished difference. Result has 131 places, 113 transitions, 1529 flow [2023-08-26 22:13:05,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1529, PETRI_PLACES=131, PETRI_TRANSITIONS=113} [2023-08-26 22:13:05,731 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 104 predicate places. [2023-08-26 22:13:05,731 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 113 transitions, 1529 flow [2023-08-26 22:13:05,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:05,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:13:05,732 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:13:05,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 22:13:05,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:13:05,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:13:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1706781436, now seen corresponding path program 1 times [2023-08-26 22:13:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:13:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486769569] [2023-08-26 22:13:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:13:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:13:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486769569] [2023-08-26 22:13:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486769569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:13:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77818962] [2023-08-26 22:13:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:13:05,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:13:05,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:13:05,986 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:13:05,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 22:13:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:13:06,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 22:13:06,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:13:06,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:13:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:13:06,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:13:06,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:13:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:10,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:13:14,706 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_527 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_38| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_526) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| v_ArrVal_527) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38|)))) is different from false [2023-08-26 22:13:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:13:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77818962] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:13:14,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:13:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-26 22:13:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626684574] [2023-08-26 22:13:14,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:13:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-26 22:13:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:13:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-26 22:13:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=238, Unknown=7, NotChecked=34, Total=380 [2023-08-26 22:13:14,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 180 [2023-08-26 22:13:14,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 113 transitions, 1529 flow. Second operand has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:13:14,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:13:14,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 180 [2023-08-26 22:13:14,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:13:15,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:16,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:18,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:19,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:21,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:22,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:23,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:25,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:26,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:28,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:31,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:32,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:33,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:13:46,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:13:58,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:00,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:02,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:04,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:06,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:14,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:16,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:18,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:20,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:22,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:24,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:37,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:55,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:57,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:14:59,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:01,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:03,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:05,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:07,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:09,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:13,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:15,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:17,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:19,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:21,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:23,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:25,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:27,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:29,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:31,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:33,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:35,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:37,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:39,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:41,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:43,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:45,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:47,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:49,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:15:49,843 INFO L124 PetriNetUnfolderBase]: 547/1119 cut-off events. [2023-08-26 22:15:49,843 INFO L125 PetriNetUnfolderBase]: For 12952/12952 co-relation queries the response was YES. [2023-08-26 22:15:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6770 conditions, 1119 events. 547/1119 cut-off events. For 12952/12952 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6329 event pairs, 44 based on Foata normal form. 75/1060 useless extension candidates. Maximal degree in co-relation 6675. Up to 243 conditions per place. [2023-08-26 22:15:49,858 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 176 selfloop transitions, 85 changer transitions 0/261 dead transitions. [2023-08-26 22:15:49,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 261 transitions, 3394 flow [2023-08-26 22:15:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 22:15:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 22:15:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1445 transitions. [2023-08-26 22:15:49,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38227513227513227 [2023-08-26 22:15:49,862 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1445 transitions. [2023-08-26 22:15:49,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1445 transitions. [2023-08-26 22:15:49,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:15:49,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1445 transitions. [2023-08-26 22:15:49,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 68.80952380952381) internal successors, (1445), 21 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:15:49,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:15:49,870 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:15:49,870 INFO L175 Difference]: Start difference. First operand has 131 places, 113 transitions, 1529 flow. Second operand 21 states and 1445 transitions. [2023-08-26 22:15:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 261 transitions, 3394 flow [2023-08-26 22:15:49,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 261 transitions, 3209 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-08-26 22:15:49,905 INFO L231 Difference]: Finished difference. Result has 150 places, 132 transitions, 1884 flow [2023-08-26 22:15:49,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1884, PETRI_PLACES=150, PETRI_TRANSITIONS=132} [2023-08-26 22:15:49,905 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 123 predicate places. [2023-08-26 22:15:49,906 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 132 transitions, 1884 flow [2023-08-26 22:15:49,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:15:49,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:15:49,906 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:15:49,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 22:15:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 22:15:50,107 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:15:50,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:15:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1486362433, now seen corresponding path program 1 times [2023-08-26 22:15:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:15:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284527272] [2023-08-26 22:15:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:15:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:15:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:15:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:15:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:15:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284527272] [2023-08-26 22:15:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284527272] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:15:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499625338] [2023-08-26 22:15:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:15:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:15:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:15:50,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:15:50,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 22:15:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:15:50,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 22:15:50,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:15:50,488 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:15:50,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:15:50,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:15:50,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:15:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:15:56,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:16:00,404 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_596 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_596) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_598) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28)))) is different from false [2023-08-26 22:16:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499625338] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:16:00,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:16:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-26 22:16:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536845328] [2023-08-26 22:16:00,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:16:00,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-26 22:16:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-26 22:16:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2023-08-26 22:16:00,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 180 [2023-08-26 22:16:00,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 132 transitions, 1884 flow. Second operand has 19 states, 19 states have (on average 68.63157894736842) internal successors, (1304), 19 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:00,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:00,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 180 [2023-08-26 22:16:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:01,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:03,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:04,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:06,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:07,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:08,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:10,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:11,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:15,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:16,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:17,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:19,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:20,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:21,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:23,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:24,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:26,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 22:16:33,538 INFO L124 PetriNetUnfolderBase]: 523/1071 cut-off events. [2023-08-26 22:16:33,538 INFO L125 PetriNetUnfolderBase]: For 12028/12028 co-relation queries the response was YES. [2023-08-26 22:16:33,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 1071 events. 523/1071 cut-off events. For 12028/12028 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5851 event pairs, 139 based on Foata normal form. 23/986 useless extension candidates. Maximal degree in co-relation 6644. Up to 694 conditions per place. [2023-08-26 22:16:33,550 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 137 selfloop transitions, 59 changer transitions 0/196 dead transitions. [2023-08-26 22:16:33,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 196 transitions, 3009 flow [2023-08-26 22:16:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 22:16:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 22:16:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 894 transitions. [2023-08-26 22:16:33,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2023-08-26 22:16:33,552 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 894 transitions. [2023-08-26 22:16:33,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 894 transitions. [2023-08-26 22:16:33,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:16:33,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 894 transitions. [2023-08-26 22:16:33,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.5) internal successors, (894), 12 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:33,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:33,557 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:33,557 INFO L175 Difference]: Start difference. First operand has 150 places, 132 transitions, 1884 flow. Second operand 12 states and 894 transitions. [2023-08-26 22:16:33,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 196 transitions, 3009 flow [2023-08-26 22:16:33,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 196 transitions, 2653 flow, removed 120 selfloop flow, removed 10 redundant places. [2023-08-26 22:16:33,596 INFO L231 Difference]: Finished difference. Result has 156 places, 144 transitions, 1999 flow [2023-08-26 22:16:33,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1999, PETRI_PLACES=156, PETRI_TRANSITIONS=144} [2023-08-26 22:16:33,596 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 129 predicate places. [2023-08-26 22:16:33,597 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 144 transitions, 1999 flow [2023-08-26 22:16:33,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 68.63157894736842) internal successors, (1304), 19 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:33,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:16:33,598 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 22:16:33,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 22:16:33,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:16:33,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:16:33,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:16:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1829764471, now seen corresponding path program 1 times [2023-08-26 22:16:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:16:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150509895] [2023-08-26 22:16:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:16:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:16:33,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150509895] [2023-08-26 22:16:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150509895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:16:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314812566] [2023-08-26 22:16:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:16:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:16:33,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:16:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 22:16:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:33,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 22:16:33,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:16:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:33,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 22:16:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314812566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:16:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 22:16:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-26 22:16:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029921250] [2023-08-26 22:16:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:16:33,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 22:16:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:33,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 22:16:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 22:16:33,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-26 22:16:33,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 144 transitions, 1999 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:33,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:33,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-26 22:16:33,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:34,200 INFO L124 PetriNetUnfolderBase]: 480/987 cut-off events. [2023-08-26 22:16:34,201 INFO L125 PetriNetUnfolderBase]: For 10029/10029 co-relation queries the response was YES. [2023-08-26 22:16:34,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 987 events. 480/987 cut-off events. For 10029/10029 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5260 event pairs, 139 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 6028. Up to 683 conditions per place. [2023-08-26 22:16:34,211 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 178 selfloop transitions, 4 changer transitions 0/182 dead transitions. [2023-08-26 22:16:34,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 182 transitions, 2747 flow [2023-08-26 22:16:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 22:16:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 22:16:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-08-26 22:16:34,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-08-26 22:16:34,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-08-26 22:16:34,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-08-26 22:16:34,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:16:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-08-26 22:16:34,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-26 22:16:34,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,215 INFO L175 Difference]: Start difference. First operand has 156 places, 144 transitions, 1999 flow. Second operand 4 states and 376 transitions. [2023-08-26 22:16:34,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 182 transitions, 2747 flow [2023-08-26 22:16:34,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 182 transitions, 2637 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-26 22:16:34,251 INFO L231 Difference]: Finished difference. Result has 154 places, 143 transitions, 1905 flow [2023-08-26 22:16:34,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1905, PETRI_PLACES=154, PETRI_TRANSITIONS=143} [2023-08-26 22:16:34,252 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-26 22:16:34,252 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1905 flow [2023-08-26 22:16:34,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:16:34,253 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 22:16:34,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 22:16:34,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:16:34,458 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:16:34,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:16:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1829764472, now seen corresponding path program 1 times [2023-08-26 22:16:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:16:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633303538] [2023-08-26 22:16:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:16:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 22:16:34,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:16:34,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633303538] [2023-08-26 22:16:34,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633303538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:16:34,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:16:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:16:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782312084] [2023-08-26 22:16:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:16:34,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:16:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:16:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:16:34,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-26 22:16:34,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:34,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-26 22:16:34,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:34,707 INFO L124 PetriNetUnfolderBase]: 437/903 cut-off events. [2023-08-26 22:16:34,708 INFO L125 PetriNetUnfolderBase]: For 8683/8683 co-relation queries the response was YES. [2023-08-26 22:16:34,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5631 conditions, 903 events. 437/903 cut-off events. For 8683/8683 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4722 event pairs, 123 based on Foata normal form. 41/922 useless extension candidates. Maximal degree in co-relation 5530. Up to 647 conditions per place. [2023-08-26 22:16:34,716 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 164 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2023-08-26 22:16:34,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 175 transitions, 2576 flow [2023-08-26 22:16:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:16:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:16:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-26 22:16:34,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-26 22:16:34,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-26 22:16:34,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-26 22:16:34,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:16:34,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-26 22:16:34,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,722 INFO L175 Difference]: Start difference. First operand has 154 places, 143 transitions, 1905 flow. Second operand 3 states and 280 transitions. [2023-08-26 22:16:34,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 175 transitions, 2576 flow [2023-08-26 22:16:34,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 175 transitions, 2569 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 22:16:34,752 INFO L231 Difference]: Finished difference. Result has 154 places, 143 transitions, 1937 flow [2023-08-26 22:16:34,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1937, PETRI_PLACES=154, PETRI_TRANSITIONS=143} [2023-08-26 22:16:34,753 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-26 22:16:34,753 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1937 flow [2023-08-26 22:16:34,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:16:34,753 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 22:16:34,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 22:16:34,753 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:16:34,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:16:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -460536745, now seen corresponding path program 1 times [2023-08-26 22:16:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:16:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303025905] [2023-08-26 22:16:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:16:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:16:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303025905] [2023-08-26 22:16:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303025905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:16:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:16:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:16:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476491259] [2023-08-26 22:16:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:16:34,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:16:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:34,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:16:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:16:34,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:16:34,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1937 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:34,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:16:34,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:34,966 INFO L124 PetriNetUnfolderBase]: 419/863 cut-off events. [2023-08-26 22:16:34,966 INFO L125 PetriNetUnfolderBase]: For 8691/8691 co-relation queries the response was YES. [2023-08-26 22:16:34,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 863 events. 419/863 cut-off events. For 8691/8691 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4422 event pairs, 129 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 5528. Up to 834 conditions per place. [2023-08-26 22:16:34,976 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 153 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2023-08-26 22:16:34,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 2387 flow [2023-08-26 22:16:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:16:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:16:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-26 22:16:34,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2023-08-26 22:16:34,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-26 22:16:34,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-26 22:16:34,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:16:34,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-26 22:16:34,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:34,979 INFO L175 Difference]: Start difference. First operand has 154 places, 143 transitions, 1937 flow. Second operand 3 states and 272 transitions. [2023-08-26 22:16:34,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 2387 flow [2023-08-26 22:16:35,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 2371 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:16:35,012 INFO L231 Difference]: Finished difference. Result has 154 places, 142 transitions, 1926 flow [2023-08-26 22:16:35,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=154, PETRI_TRANSITIONS=142} [2023-08-26 22:16:35,013 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-26 22:16:35,013 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 142 transitions, 1926 flow [2023-08-26 22:16:35,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:16:35,013 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 22:16:35,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 22:16:35,013 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:16:35,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:16:35,014 INFO L85 PathProgramCache]: Analyzing trace with hash -460536744, now seen corresponding path program 1 times [2023-08-26 22:16:35,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:16:35,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92119349] [2023-08-26 22:16:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:16:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 22:16:35,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:16:35,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92119349] [2023-08-26 22:16:35,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92119349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:16:35,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 22:16:35,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 22:16:35,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009093955] [2023-08-26 22:16:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:16:35,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 22:16:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 22:16:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 22:16:35,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-26 22:16:35,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 142 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:35,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-26 22:16:35,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:35,212 INFO L124 PetriNetUnfolderBase]: 401/823 cut-off events. [2023-08-26 22:16:35,213 INFO L125 PetriNetUnfolderBase]: For 8204/8204 co-relation queries the response was YES. [2023-08-26 22:16:35,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 823 events. 401/823 cut-off events. For 8204/8204 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4180 event pairs, 91 based on Foata normal form. 22/845 useless extension candidates. Maximal degree in co-relation 5299. Up to 630 conditions per place. [2023-08-26 22:16:35,220 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 149 selfloop transitions, 14 changer transitions 0/163 dead transitions. [2023-08-26 22:16:35,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 2494 flow [2023-08-26 22:16:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 22:16:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 22:16:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-26 22:16:35,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-08-26 22:16:35,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-26 22:16:35,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-26 22:16:35,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:16:35,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-26 22:16:35,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,225 INFO L175 Difference]: Start difference. First operand has 154 places, 142 transitions, 1926 flow. Second operand 3 states and 273 transitions. [2023-08-26 22:16:35,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 163 transitions, 2494 flow [2023-08-26 22:16:35,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 163 transitions, 2492 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:16:35,256 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 1948 flow [2023-08-26 22:16:35,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2023-08-26 22:16:35,257 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-26 22:16:35,257 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1948 flow [2023-08-26 22:16:35,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:35,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:16:35,257 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:16:35,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 22:16:35,257 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:16:35,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:16:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1801140384, now seen corresponding path program 1 times [2023-08-26 22:16:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:16:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572313713] [2023-08-26 22:16:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:16:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:16:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572313713] [2023-08-26 22:16:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572313713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:16:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255675335] [2023-08-26 22:16:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:16:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:16:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:16:35,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:16:35,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 22:16:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:16:36,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 22:16:36,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:16:36,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:16:36,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:16:36,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:16:36,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-26 22:16:36,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:16:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:36,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:16:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:16:46,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255675335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:16:46,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:16:46,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-26 22:16:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570670612] [2023-08-26 22:16:46,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:16:46,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 22:16:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:16:46,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 22:16:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=919, Unknown=7, NotChecked=0, Total=1122 [2023-08-26 22:16:46,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-26 22:16:46,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1948 flow. Second operand has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:16:46,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:16:46,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-26 22:16:46,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:16:47,617 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_859) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_861)))) (= .cse1 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (exists ((v_ArrVal_861 Int)) (and (<= v_ArrVal_861 (+ (select .cse1 0) 1)) (= (select |c_#memory_int| 1) (store .cse1 0 v_ArrVal_861)))))) is different from false [2023-08-26 22:16:48,365 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_859) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_861)))) (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_861)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_861) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_861 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_861 (+ (select .cse1 0) 1)) (= (select |c_#memory_int| 1) (store .cse1 0 v_ArrVal_861)))))) is different from false [2023-08-26 22:16:50,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:16:56,888 WARN L234 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 61 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:16:58,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:17:00,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:17:01,079 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ (select .cse0 0) 1)) (.cse4 (select |c_#memory_int| 1))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= v_ArrVal_861 .cse3) (= (store (store .cse0 0 v_ArrVal_861) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_863) .cse4))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (let ((.cse5 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_859) |c_~#cache~0.base|))) (or (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse5 |c_~#cache~0.offset|) 1) v_ArrVal_861)))) (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_861)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_861) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (or (= .cse0 .cse1) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (<= (select .cse1 .cse2) 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_861 Int)) (and (<= v_ArrVal_861 .cse3) (= .cse4 (store .cse0 0 v_ArrVal_861))))))) is different from false [2023-08-26 22:17:07,990 WARN L234 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 67 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:17:18,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:17:22,641 INFO L124 PetriNetUnfolderBase]: 825/1643 cut-off events. [2023-08-26 22:17:22,641 INFO L125 PetriNetUnfolderBase]: For 20686/20686 co-relation queries the response was YES. [2023-08-26 22:17:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11250 conditions, 1643 events. 825/1643 cut-off events. For 20686/20686 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9350 event pairs, 145 based on Foata normal form. 48/1691 useless extension candidates. Maximal degree in co-relation 11148. Up to 777 conditions per place. [2023-08-26 22:17:22,657 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 234 selfloop transitions, 222 changer transitions 0/456 dead transitions. [2023-08-26 22:17:22,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 456 transitions, 6872 flow [2023-08-26 22:17:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-08-26 22:17:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-08-26 22:17:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3065 transitions. [2023-08-26 22:17:22,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3040674603174603 [2023-08-26 22:17:22,662 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3065 transitions. [2023-08-26 22:17:22,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3065 transitions. [2023-08-26 22:17:22,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:17:22,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3065 transitions. [2023-08-26 22:17:22,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 54.732142857142854) internal successors, (3065), 56 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:22,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 180.0) internal successors, (10260), 57 states have internal predecessors, (10260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:22,679 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 180.0) internal successors, (10260), 57 states have internal predecessors, (10260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:22,680 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 1948 flow. Second operand 56 states and 3065 transitions. [2023-08-26 22:17:22,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 456 transitions, 6872 flow [2023-08-26 22:17:22,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 456 transitions, 6836 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 22:17:22,748 INFO L231 Difference]: Finished difference. Result has 233 places, 336 transitions, 5570 flow [2023-08-26 22:17:22,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=5570, PETRI_PLACES=233, PETRI_TRANSITIONS=336} [2023-08-26 22:17:22,749 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 206 predicate places. [2023-08-26 22:17:22,749 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 336 transitions, 5570 flow [2023-08-26 22:17:22,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:22,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:17:22,749 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:17:22,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 22:17:22,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:17:22,954 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:17:22,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:17:22,955 INFO L85 PathProgramCache]: Analyzing trace with hash -886966939, now seen corresponding path program 1 times [2023-08-26 22:17:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:17:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291304338] [2023-08-26 22:17:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:17:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:17:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:17:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:17:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291304338] [2023-08-26 22:17:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291304338] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:17:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082517135] [2023-08-26 22:17:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:17:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:17:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:17:23,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:17:23,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 22:17:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:17:23,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 22:17:23,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:17:23,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:17:23,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:17:23,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:17:23,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:17:24,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:17:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:24,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:17:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082517135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:17:26,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:17:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-26 22:17:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708246409] [2023-08-26 22:17:26,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:17:26,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 22:17:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:17:26,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 22:17:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=751, Unknown=2, NotChecked=0, Total=930 [2023-08-26 22:17:26,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-26 22:17:26,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 336 transitions, 5570 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:26,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:17:26,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-26 22:17:26,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:17:34,692 INFO L124 PetriNetUnfolderBase]: 1111/2235 cut-off events. [2023-08-26 22:17:34,693 INFO L125 PetriNetUnfolderBase]: For 40322/40322 co-relation queries the response was YES. [2023-08-26 22:17:34,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17993 conditions, 2235 events. 1111/2235 cut-off events. For 40322/40322 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13839 event pairs, 283 based on Foata normal form. 49/2284 useless extension candidates. Maximal degree in co-relation 17864. Up to 1618 conditions per place. [2023-08-26 22:17:34,715 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 377 selfloop transitions, 169 changer transitions 9/555 dead transitions. [2023-08-26 22:17:34,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 555 transitions, 9685 flow [2023-08-26 22:17:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-26 22:17:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-26 22:17:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2105 transitions. [2023-08-26 22:17:34,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34395424836601307 [2023-08-26 22:17:34,726 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2105 transitions. [2023-08-26 22:17:34,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2105 transitions. [2023-08-26 22:17:34,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:17:34,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2105 transitions. [2023-08-26 22:17:34,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 61.911764705882355) internal successors, (2105), 34 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:34,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 180.0) internal successors, (6300), 35 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:34,742 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 180.0) internal successors, (6300), 35 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:34,742 INFO L175 Difference]: Start difference. First operand has 233 places, 336 transitions, 5570 flow. Second operand 34 states and 2105 transitions. [2023-08-26 22:17:34,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 555 transitions, 9685 flow [2023-08-26 22:17:34,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 555 transitions, 9320 flow, removed 110 selfloop flow, removed 8 redundant places. [2023-08-26 22:17:34,922 INFO L231 Difference]: Finished difference. Result has 276 places, 470 transitions, 7919 flow [2023-08-26 22:17:34,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=5279, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7919, PETRI_PLACES=276, PETRI_TRANSITIONS=470} [2023-08-26 22:17:34,923 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 249 predicate places. [2023-08-26 22:17:34,923 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 470 transitions, 7919 flow [2023-08-26 22:17:34,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:34,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:17:34,924 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:17:34,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 22:17:35,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-26 22:17:35,130 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:17:35,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:17:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -421351219, now seen corresponding path program 2 times [2023-08-26 22:17:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:17:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435454380] [2023-08-26 22:17:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:17:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:17:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:17:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:17:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435454380] [2023-08-26 22:17:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435454380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:17:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409599431] [2023-08-26 22:17:35,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 22:17:35,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:17:35,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:17:35,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:17:35,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 22:17:35,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 22:17:35,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:17:35,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 22:17:35,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:17:35,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:17:35,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:17:35,894 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:17:36,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:17:36,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:17:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:36,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:17:36,623 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_1023 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1019) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1023) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 22:17:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409599431] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:17:36,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:17:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-26 22:17:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678859195] [2023-08-26 22:17:36,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:17:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-26 22:17:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:17:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-26 22:17:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=664, Unknown=1, NotChecked=54, Total=870 [2023-08-26 22:17:36,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-26 22:17:36,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 470 transitions, 7919 flow. Second operand has 30 states, 30 states have (on average 51.5) internal successors, (1545), 30 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:36,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:17:36,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-26 22:17:36,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:17:49,397 INFO L124 PetriNetUnfolderBase]: 1832/3721 cut-off events. [2023-08-26 22:17:49,397 INFO L125 PetriNetUnfolderBase]: For 83304/83304 co-relation queries the response was YES. [2023-08-26 22:17:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30680 conditions, 3721 events. 1832/3721 cut-off events. For 83304/83304 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 26671 event pairs, 464 based on Foata normal form. 131/3852 useless extension candidates. Maximal degree in co-relation 30534. Up to 2171 conditions per place. [2023-08-26 22:17:49,435 INFO L140 encePairwiseOnDemand]: 165/180 looper letters, 566 selfloop transitions, 432 changer transitions 16/1014 dead transitions. [2023-08-26 22:17:49,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 1014 transitions, 17454 flow [2023-08-26 22:17:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-08-26 22:17:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2023-08-26 22:17:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 5728 transitions. [2023-08-26 22:17:49,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30306878306878304 [2023-08-26 22:17:49,443 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 5728 transitions. [2023-08-26 22:17:49,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 5728 transitions. [2023-08-26 22:17:49,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:17:49,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 5728 transitions. [2023-08-26 22:17:49,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 54.55238095238095) internal successors, (5728), 105 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:49,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 180.0) internal successors, (19080), 106 states have internal predecessors, (19080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:49,472 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 180.0) internal successors, (19080), 106 states have internal predecessors, (19080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:49,472 INFO L175 Difference]: Start difference. First operand has 276 places, 470 transitions, 7919 flow. Second operand 105 states and 5728 transitions. [2023-08-26 22:17:49,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 1014 transitions, 17454 flow [2023-08-26 22:17:49,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1014 transitions, 17086 flow, removed 174 selfloop flow, removed 3 redundant places. [2023-08-26 22:17:49,838 INFO L231 Difference]: Finished difference. Result has 424 places, 820 transitions, 14344 flow [2023-08-26 22:17:49,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=7585, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=14344, PETRI_PLACES=424, PETRI_TRANSITIONS=820} [2023-08-26 22:17:49,839 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 397 predicate places. [2023-08-26 22:17:49,839 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 820 transitions, 14344 flow [2023-08-26 22:17:49,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 51.5) internal successors, (1545), 30 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:17:49,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:17:49,840 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:17:49,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 22:17:50,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 22:17:50,040 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:17:50,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:17:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -396176358, now seen corresponding path program 2 times [2023-08-26 22:17:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:17:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795212771] [2023-08-26 22:17:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:17:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:17:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:17:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:17:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795212771] [2023-08-26 22:17:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795212771] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:17:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503814164] [2023-08-26 22:17:50,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 22:17:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:17:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:17:50,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:17:50,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 22:17:50,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 22:17:50,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:17:50,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 22:17:50,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:17:50,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:17:51,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:17:51,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:17:51,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-26 22:17:51,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:17:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:17:51,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:18:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:18:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503814164] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:18:12,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:18:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-26 22:18:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558563537] [2023-08-26 22:18:12,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:18:12,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 22:18:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:18:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 22:18:12,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=957, Unknown=10, NotChecked=0, Total=1122 [2023-08-26 22:18:12,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-26 22:18:12,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 820 transitions, 14344 flow. Second operand has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:18:12,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:18:12,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-26 22:18:12,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:18:26,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:18:28,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:18:35,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:18:37,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:18:39,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:18:48,756 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse12 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse12 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (+ .cse12 28 |c_~#cache~0.offset|)) (.cse7 (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse6 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse11 ((as const (Array Int Int)) 0)) (.cse8 (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1101 Int) (v_ArrVal_1102 Int)) (or (< (select (store (store .cse0 .cse1 v_ArrVal_1101) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_1102) .cse2) 2147483647) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1101) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| .cse3))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1101 Int) (v_ArrVal_1102 Int)) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1101) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1101) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_1102) .cse2) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| .cse4))) (or (not .cse5) (and .cse6 (<= .cse7 1) .cse8)) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1101 Int) (v_ArrVal_1102 Int)) (or (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1101)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_1102) .cse2) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| .cse3) (< (+ .cse7 1) v_ArrVal_1101))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1101 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1102 Int) (v_ArrVal_1099 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1099) |c_~#cache~0.base|))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| .cse4) (< (+ (select .cse10 |c_~#cache~0.offset|) 1) v_ArrVal_1101) (< (select (store (store .cse10 |c_~#cache~0.offset| v_ArrVal_1101) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_1102) |c_~#cache~0.offset|) 2147483647)))) (exists ((v_ArrVal_1101 Int)) (and (= (store .cse11 0 v_ArrVal_1101) (select |c_#memory_int| 1)) (<= v_ArrVal_1101 (+ (select .cse11 0) 1)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (or (and .cse6 (= .cse11 (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) .cse8) .cse5)))) is different from false [2023-08-26 22:18:51,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:18:57,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:00,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:02,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:05,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:07,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:09,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:37,114 WARN L234 SmtUtils]: Spent 23.79s on a formula simplification. DAG size of input: 82 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:19:39,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:41,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:43,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:19:58,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:20:01,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:20:39,926 WARN L234 SmtUtils]: Spent 32.45s on a formula simplification. DAG size of input: 93 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:20:41,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:20:43,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:20:45,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:20:47,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:21:03,189 WARN L234 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:21:05,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:21:09,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:21:17,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:21:30,112 WARN L234 SmtUtils]: Spent 11.88s on a formula simplification. DAG size of input: 83 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 22:21:32,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:41,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:43,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:45,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:47,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:49,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:51,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:53,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:55,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:21:58,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:22:00,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:22:02,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:22:04,695 INFO L124 PetriNetUnfolderBase]: 1955/3973 cut-off events. [2023-08-26 22:22:04,695 INFO L125 PetriNetUnfolderBase]: For 135967/135967 co-relation queries the response was YES. [2023-08-26 22:22:04,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37757 conditions, 3973 events. 1955/3973 cut-off events. For 135967/135967 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 28979 event pairs, 664 based on Foata normal form. 12/3985 useless extension candidates. Maximal degree in co-relation 37563. Up to 3474 conditions per place. [2023-08-26 22:22:04,747 INFO L140 encePairwiseOnDemand]: 166/180 looper letters, 740 selfloop transitions, 259 changer transitions 1/1000 dead transitions. [2023-08-26 22:22:04,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1000 transitions, 19285 flow [2023-08-26 22:22:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-26 22:22:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-26 22:22:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 2752 transitions. [2023-08-26 22:22:04,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29978213507625273 [2023-08-26 22:22:04,754 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 2752 transitions. [2023-08-26 22:22:04,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 2752 transitions. [2023-08-26 22:22:04,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:22:04,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 2752 transitions. [2023-08-26 22:22:04,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 53.96078431372549) internal successors, (2752), 51 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:04,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 180.0) internal successors, (9360), 52 states have internal predecessors, (9360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:04,770 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 180.0) internal successors, (9360), 52 states have internal predecessors, (9360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:04,770 INFO L175 Difference]: Start difference. First operand has 424 places, 820 transitions, 14344 flow. Second operand 51 states and 2752 transitions. [2023-08-26 22:22:04,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1000 transitions, 19285 flow [2023-08-26 22:22:05,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 1000 transitions, 17783 flow, removed 585 selfloop flow, removed 16 redundant places. [2023-08-26 22:22:05,654 INFO L231 Difference]: Finished difference. Result has 476 places, 923 transitions, 15658 flow [2023-08-26 22:22:05,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=12884, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=15658, PETRI_PLACES=476, PETRI_TRANSITIONS=923} [2023-08-26 22:22:05,656 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 449 predicate places. [2023-08-26 22:22:05,656 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 923 transitions, 15658 flow [2023-08-26 22:22:05,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:05,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:22:05,656 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:22:05,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 22:22:05,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 22:22:05,863 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:22:05,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:22:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1965343907, now seen corresponding path program 3 times [2023-08-26 22:22:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:22:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266457457] [2023-08-26 22:22:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:22:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:22:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:22:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:22:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266457457] [2023-08-26 22:22:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266457457] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:22:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094601822] [2023-08-26 22:22:06,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 22:22:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:22:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:22:06,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:22:06,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 22:22:06,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 22:22:06,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:22:06,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 22:22:06,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:22:06,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:22:06,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:22:06,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:22:07,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:22:07,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:22:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:07,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:22:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094601822] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:22:12,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:22:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-26 22:22:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663156745] [2023-08-26 22:22:12,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:22:12,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 22:22:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:22:12,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 22:22:12,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=738, Unknown=8, NotChecked=0, Total=930 [2023-08-26 22:22:12,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-26 22:22:12,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 923 transitions, 15658 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:12,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:22:12,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-26 22:22:12,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:22:17,391 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1182 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ 28 |c_~#cache~0.offset|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-26 22:22:20,425 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ 28 |c_~#cache~0.offset|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-26 22:22:22,060 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int)) (or (< (select .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ .cse2 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1182 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ .cse2 28 |c_~#cache~0.offset|)) (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647))) (forall ((v_ArrVal_1182 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| .cse0) (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647))))) is different from false [2023-08-26 22:22:25,910 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1182 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1182)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1182 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1182) (select |c_#memory_int| 1))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-26 22:22:30,755 INFO L124 PetriNetUnfolderBase]: 2230/4573 cut-off events. [2023-08-26 22:22:30,756 INFO L125 PetriNetUnfolderBase]: For 187384/187384 co-relation queries the response was YES. [2023-08-26 22:22:30,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43464 conditions, 4573 events. 2230/4573 cut-off events. For 187384/187384 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 34818 event pairs, 696 based on Foata normal form. 73/4646 useless extension candidates. Maximal degree in co-relation 43255. Up to 3782 conditions per place. [2023-08-26 22:22:30,881 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 883 selfloop transitions, 311 changer transitions 15/1209 dead transitions. [2023-08-26 22:22:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 1209 transitions, 23036 flow [2023-08-26 22:22:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-08-26 22:22:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2023-08-26 22:22:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 3766 transitions. [2023-08-26 22:22:30,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3374551971326165 [2023-08-26 22:22:30,887 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 3766 transitions. [2023-08-26 22:22:30,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 3766 transitions. [2023-08-26 22:22:30,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:22:30,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 3766 transitions. [2023-08-26 22:22:30,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 60.74193548387097) internal successors, (3766), 62 states have internal predecessors, (3766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:30,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 180.0) internal successors, (11340), 63 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:30,924 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 180.0) internal successors, (11340), 63 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:30,925 INFO L175 Difference]: Start difference. First operand has 476 places, 923 transitions, 15658 flow. Second operand 62 states and 3766 transitions. [2023-08-26 22:22:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 1209 transitions, 23036 flow [2023-08-26 22:22:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 1209 transitions, 22499 flow, removed 126 selfloop flow, removed 22 redundant places. [2023-08-26 22:22:32,044 INFO L231 Difference]: Finished difference. Result has 554 places, 1103 transitions, 19527 flow [2023-08-26 22:22:32,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=15192, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=19527, PETRI_PLACES=554, PETRI_TRANSITIONS=1103} [2023-08-26 22:22:32,046 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 527 predicate places. [2023-08-26 22:22:32,046 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 1103 transitions, 19527 flow [2023-08-26 22:22:32,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:32,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:22:32,047 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:22:32,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 22:22:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 22:22:32,252 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:22:32,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:22:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -369578171, now seen corresponding path program 4 times [2023-08-26 22:22:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:22:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504220351] [2023-08-26 22:22:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:22:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:22:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:22:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:22:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504220351] [2023-08-26 22:22:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504220351] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:22:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69827536] [2023-08-26 22:22:32,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 22:22:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:22:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:22:32,843 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:22:32,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 22:22:32,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 22:22:32,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:22:32,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-26 22:22:32,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:22:32,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:22:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:22:33,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:22:33,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-08-26 22:22:33,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-08-26 22:22:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:33,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:22:34,751 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int)) (or (< (select (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1259) |c_~#cache~0.base|))) (store .cse0 |c_~#cache~0.offset| (+ (select .cse0 |c_~#cache~0.offset|) 1))) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) is different from false [2023-08-26 22:22:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:22:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69827536] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:22:34,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:22:34,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2023-08-26 22:22:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246718911] [2023-08-26 22:22:34,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:22:34,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 22:22:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:22:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 22:22:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=886, Unknown=1, NotChecked=64, Total=1190 [2023-08-26 22:22:34,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 180 [2023-08-26 22:22:34,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 1103 transitions, 19527 flow. Second operand has 35 states, 35 states have (on average 45.285714285714285) internal successors, (1585), 35 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:22:34,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:22:34,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 180 [2023-08-26 22:22:34,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:23:39,643 INFO L124 PetriNetUnfolderBase]: 3029/6295 cut-off events. [2023-08-26 22:23:39,643 INFO L125 PetriNetUnfolderBase]: For 386222/386222 co-relation queries the response was YES. [2023-08-26 22:23:39,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70663 conditions, 6295 events. 3029/6295 cut-off events. For 386222/386222 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 52087 event pairs, 533 based on Foata normal form. 75/6370 useless extension candidates. Maximal degree in co-relation 70414. Up to 4036 conditions per place. [2023-08-26 22:23:39,729 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 910 selfloop transitions, 969 changer transitions 2/1881 dead transitions. [2023-08-26 22:23:39,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 1881 transitions, 39324 flow [2023-08-26 22:23:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-08-26 22:23:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2023-08-26 22:23:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 4335 transitions. [2023-08-26 22:23:39,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2705992509363296 [2023-08-26 22:23:39,735 INFO L72 ComplementDD]: Start complementDD. Operand 89 states and 4335 transitions. [2023-08-26 22:23:39,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 4335 transitions. [2023-08-26 22:23:39,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:23:39,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 4335 transitions. [2023-08-26 22:23:39,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 90 states, 89 states have (on average 48.70786516853933) internal successors, (4335), 89 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:39,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 90 states, 90 states have (on average 180.0) internal successors, (16200), 90 states have internal predecessors, (16200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:39,752 INFO L81 ComplementDD]: Finished complementDD. Result has 90 states, 90 states have (on average 180.0) internal successors, (16200), 90 states have internal predecessors, (16200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:39,752 INFO L175 Difference]: Start difference. First operand has 554 places, 1103 transitions, 19527 flow. Second operand 89 states and 4335 transitions. [2023-08-26 22:23:39,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 1881 transitions, 39324 flow [2023-08-26 22:23:42,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 1881 transitions, 37612 flow, removed 811 selfloop flow, removed 10 redundant places. [2023-08-26 22:23:42,404 INFO L231 Difference]: Finished difference. Result has 664 places, 1737 transitions, 34174 flow [2023-08-26 22:23:42,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=18233, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=34174, PETRI_PLACES=664, PETRI_TRANSITIONS=1737} [2023-08-26 22:23:42,405 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 637 predicate places. [2023-08-26 22:23:42,406 INFO L495 AbstractCegarLoop]: Abstraction has has 664 places, 1737 transitions, 34174 flow [2023-08-26 22:23:42,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 45.285714285714285) internal successors, (1585), 35 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:42,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:23:42,406 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:23:42,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-26 22:23:42,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 22:23:42,609 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:23:42,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:23:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1075114869, now seen corresponding path program 5 times [2023-08-26 22:23:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:23:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559016049] [2023-08-26 22:23:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:23:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:23:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:23:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:23:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:23:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559016049] [2023-08-26 22:23:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559016049] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:23:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424207635] [2023-08-26 22:23:43,211 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 22:23:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:23:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:23:43,213 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:23:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 22:23:43,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-26 22:23:43,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:23:43,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-26 22:23:43,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:23:43,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 22:23:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:23:43,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 22:23:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424207635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 22:23:43,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 22:23:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-26 22:23:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271511990] [2023-08-26 22:23:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 22:23:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 22:23:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:23:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 22:23:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-08-26 22:23:43,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 180 [2023-08-26 22:23:43,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 1737 transitions, 34174 flow. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:43,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:23:43,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 180 [2023-08-26 22:23:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:23:47,112 INFO L124 PetriNetUnfolderBase]: 2878/5962 cut-off events. [2023-08-26 22:23:47,112 INFO L125 PetriNetUnfolderBase]: For 436480/436480 co-relation queries the response was YES. [2023-08-26 22:23:47,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75464 conditions, 5962 events. 2878/5962 cut-off events. For 436480/436480 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 48422 event pairs, 567 based on Foata normal form. 4/5966 useless extension candidates. Maximal degree in co-relation 75183. Up to 4100 conditions per place. [2023-08-26 22:23:47,206 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 1523 selfloop transitions, 157 changer transitions 0/1680 dead transitions. [2023-08-26 22:23:47,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 1680 transitions, 35666 flow [2023-08-26 22:23:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 22:23:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 22:23:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2023-08-26 22:23:47,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-26 22:23:47,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 385 transitions. [2023-08-26 22:23:47,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 385 transitions. [2023-08-26 22:23:47,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:23:47,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 385 transitions. [2023-08-26 22:23:47,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:47,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:47,211 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:47,211 INFO L175 Difference]: Start difference. First operand has 664 places, 1737 transitions, 34174 flow. Second operand 5 states and 385 transitions. [2023-08-26 22:23:47,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 1680 transitions, 35666 flow [2023-08-26 22:23:51,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 1680 transitions, 33640 flow, removed 892 selfloop flow, removed 22 redundant places. [2023-08-26 22:23:51,339 INFO L231 Difference]: Finished difference. Result has 616 places, 1546 transitions, 28004 flow [2023-08-26 22:23:51,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=27282, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28004, PETRI_PLACES=616, PETRI_TRANSITIONS=1546} [2023-08-26 22:23:51,341 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 589 predicate places. [2023-08-26 22:23:51,341 INFO L495 AbstractCegarLoop]: Abstraction has has 616 places, 1546 transitions, 28004 flow [2023-08-26 22:23:51,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:51,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:23:51,341 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:23:51,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 22:23:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:23:51,548 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:23:51,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:23:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -549299141, now seen corresponding path program 6 times [2023-08-26 22:23:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:23:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463385932] [2023-08-26 22:23:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:23:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:23:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:23:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:23:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:23:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463385932] [2023-08-26 22:23:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463385932] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:23:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005682036] [2023-08-26 22:23:52,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 22:23:52,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:23:52,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:23:52,105 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:23:52,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 22:23:52,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-26 22:23:52,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:23:52,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 22:23:52,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:23:52,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:23:52,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:23:52,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:23:52,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:23:52,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:23:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:23:52,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:23:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:23:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005682036] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:23:57,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:23:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-26 22:23:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832152427] [2023-08-26 22:23:57,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:23:57,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 22:23:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:23:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 22:23:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=793, Unknown=7, NotChecked=0, Total=992 [2023-08-26 22:23:57,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-26 22:23:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 1546 transitions, 28004 flow. Second operand has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:23:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:23:57,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-26 22:23:57,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:24:00,322 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1416 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1416) (select |c_#memory_int| 1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1416 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1416)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1416 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse0) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1416)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-26 22:24:02,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:24:10,060 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1416 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1416)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-26 22:24:20,935 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-26 22:24:30,357 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| 1)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1416 Int)) (= (store .cse0 0 v_ArrVal_1416) .cse1)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1419 Int)) (= .cse1 (store .cse0 0 v_ArrVal_1419))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1416 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1416)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-26 22:24:39,450 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ .cse0 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1419 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1419))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1416 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1416)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-26 22:24:51,917 INFO L124 PetriNetUnfolderBase]: 3771/7867 cut-off events. [2023-08-26 22:24:51,917 INFO L125 PetriNetUnfolderBase]: For 582563/582563 co-relation queries the response was YES. [2023-08-26 22:24:52,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91193 conditions, 7867 events. 3771/7867 cut-off events. For 582563/582563 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 68045 event pairs, 908 based on Foata normal form. 154/8021 useless extension candidates. Maximal degree in co-relation 90926. Up to 5589 conditions per place. [2023-08-26 22:24:52,040 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 1502 selfloop transitions, 837 changer transitions 13/2352 dead transitions. [2023-08-26 22:24:52,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 2352 transitions, 49694 flow [2023-08-26 22:24:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-08-26 22:24:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2023-08-26 22:24:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 5555 transitions. [2023-08-26 22:24:52,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33913308913308915 [2023-08-26 22:24:52,048 INFO L72 ComplementDD]: Start complementDD. Operand 91 states and 5555 transitions. [2023-08-26 22:24:52,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 5555 transitions. [2023-08-26 22:24:52,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:24:52,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 91 states and 5555 transitions. [2023-08-26 22:24:52,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 92 states, 91 states have (on average 61.043956043956044) internal successors, (5555), 91 states have internal predecessors, (5555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:24:52,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 92 states, 92 states have (on average 180.0) internal successors, (16560), 92 states have internal predecessors, (16560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:24:52,066 INFO L81 ComplementDD]: Finished complementDD. Result has 92 states, 92 states have (on average 180.0) internal successors, (16560), 92 states have internal predecessors, (16560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:24:52,066 INFO L175 Difference]: Start difference. First operand has 616 places, 1546 transitions, 28004 flow. Second operand 91 states and 5555 transitions. [2023-08-26 22:24:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 2352 transitions, 49694 flow [2023-08-26 22:24:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 2352 transitions, 49490 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 22:24:56,272 INFO L231 Difference]: Finished difference. Result has 763 places, 2119 transitions, 42760 flow [2023-08-26 22:24:56,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=27834, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=42760, PETRI_PLACES=763, PETRI_TRANSITIONS=2119} [2023-08-26 22:24:56,274 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 736 predicate places. [2023-08-26 22:24:56,274 INFO L495 AbstractCegarLoop]: Abstraction has has 763 places, 2119 transitions, 42760 flow [2023-08-26 22:24:56,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:24:56,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:24:56,275 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:24:56,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 22:24:56,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:24:56,477 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:24:56,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:24:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash 9669783, now seen corresponding path program 7 times [2023-08-26 22:24:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:24:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140156685] [2023-08-26 22:24:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:24:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:24:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:24:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:24:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:24:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140156685] [2023-08-26 22:24:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140156685] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:24:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975138322] [2023-08-26 22:24:57,034 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-26 22:24:57,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:24:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:24:57,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:24:57,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 22:24:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:24:57,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 22:24:57,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:24:57,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:24:57,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:24:57,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:24:57,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 22:24:57,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:24:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:24:57,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:25:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:25:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975138322] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:25:00,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:25:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-26 22:25:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923424078] [2023-08-26 22:25:00,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:25:00,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 22:25:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:25:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 22:25:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=745, Unknown=5, NotChecked=0, Total=930 [2023-08-26 22:25:00,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-26 22:25:00,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 2119 transitions, 42760 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:00,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:25:00,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-26 22:25:00,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:25:11,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:25:14,152 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_1496 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1496) (select |c_#memory_int| 1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1496)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1498))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1498 Int) (v_ArrVal_1495 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse1) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1495) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))))) is different from false [2023-08-26 22:25:16,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:25:18,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:25:21,813 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1498 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1498))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1498 Int) (v_ArrVal_1495 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1495) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-26 22:25:25,015 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1498 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1498))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1496)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1498))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ .cse1 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ .cse1 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1498)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (forall ((v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1498)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1498 Int) (v_ArrVal_1495 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse3) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1495) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-26 22:25:30,218 INFO L124 PetriNetUnfolderBase]: 4144/8692 cut-off events. [2023-08-26 22:25:30,218 INFO L125 PetriNetUnfolderBase]: For 954193/954193 co-relation queries the response was YES. [2023-08-26 22:25:30,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118304 conditions, 8692 events. 4144/8692 cut-off events. For 954193/954193 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 77636 event pairs, 1155 based on Foata normal form. 67/8759 useless extension candidates. Maximal degree in co-relation 117977. Up to 7339 conditions per place. [2023-08-26 22:25:30,380 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 2006 selfloop transitions, 468 changer transitions 16/2490 dead transitions. [2023-08-26 22:25:30,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 2490 transitions, 56440 flow [2023-08-26 22:25:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-26 22:25:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-26 22:25:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2882 transitions. [2023-08-26 22:25:30,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34066193853427895 [2023-08-26 22:25:30,383 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2882 transitions. [2023-08-26 22:25:30,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2882 transitions. [2023-08-26 22:25:30,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 22:25:30,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2882 transitions. [2023-08-26 22:25:30,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 61.319148936170215) internal successors, (2882), 47 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:30,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 180.0) internal successors, (8640), 48 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:30,394 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 180.0) internal successors, (8640), 48 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:30,394 INFO L175 Difference]: Start difference. First operand has 763 places, 2119 transitions, 42760 flow. Second operand 47 states and 2882 transitions. [2023-08-26 22:25:30,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 2490 transitions, 56440 flow [2023-08-26 22:25:38,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 2490 transitions, 52969 flow, removed 1677 selfloop flow, removed 11 redundant places. [2023-08-26 22:25:38,319 INFO L231 Difference]: Finished difference. Result has 823 places, 2345 transitions, 45933 flow [2023-08-26 22:25:38,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=39305, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=45933, PETRI_PLACES=823, PETRI_TRANSITIONS=2345} [2023-08-26 22:25:38,323 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 796 predicate places. [2023-08-26 22:25:38,323 INFO L495 AbstractCegarLoop]: Abstraction has has 823 places, 2345 transitions, 45933 flow [2023-08-26 22:25:38,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:38,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 22:25:38,323 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:25:38,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 22:25:38,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:25:38,529 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 22:25:38,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 22:25:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 942265854, now seen corresponding path program 3 times [2023-08-26 22:25:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 22:25:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401002747] [2023-08-26 22:25:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 22:25:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 22:25:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 22:25:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:25:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 22:25:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401002747] [2023-08-26 22:25:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401002747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 22:25:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6903645] [2023-08-26 22:25:39,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 22:25:39,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 22:25:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 22:25:39,173 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 22:25:39,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-26 22:25:39,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 22:25:39,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 22:25:39,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 22:25:39,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 22:25:39,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 22:25:39,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 22:25:39,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 22:25:39,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-26 22:25:39,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 22:25:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:25:39,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 22:25:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 22:25:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6903645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 22:25:49,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 22:25:49,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-26 22:25:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223500645] [2023-08-26 22:25:49,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 22:25:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 22:25:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 22:25:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 22:25:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=917, Unknown=6, NotChecked=0, Total=1122 [2023-08-26 22:25:49,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-26 22:25:49,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 2345 transitions, 45933 flow. Second operand has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 22:25:49,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 22:25:49,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-26 22:25:49,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 22:25:51,346 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1577) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1578) |c_~#cache~0.offset|) 2147483647))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_1577 Int)) (and (= (store .cse0 0 v_ArrVal_1577) (select |c_#memory_int| 1)) (<= v_ArrVal_1577 (+ (select .cse0 0) 1)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|))) (or (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1577) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1577) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1578) |c_~#cache~0.offset|) 2147483647)))) (<= (select .cse1 .cse2) 1)))) is different from false [2023-08-26 22:25:51,505 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (select |c_#memory_int| 1)) (.cse2 (+ (select .cse0 0) 1))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_1577 Int)) (and (= (store .cse0 0 v_ArrVal_1577) .cse1) (<= v_ArrVal_1577 .cse2))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= .cse0 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|))) (or (< (+ (select .cse4 |c_~#cache~0.offset|) 1) v_ArrVal_1577) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse4 |c_~#cache~0.offset| v_ArrVal_1577) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1578) |c_~#cache~0.offset|) 2147483647)))) (<= (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (and (<= 28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= .cse1 (store (store .cse0 0 v_ArrVal_1577) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578)) (<= v_ArrVal_1577 .cse2)))))) is different from false [2023-08-26 22:25:51,536 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1577) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1578) |c_~#cache~0.offset|) 2147483647))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (exists ((v_ArrVal_1577 Int)) (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (store .cse0 0 v_ArrVal_1577) (select |c_#memory_int| 1)) (<= v_ArrVal_1577 (+ (select .cse0 0) 1))))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (let ((.cse1 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|))) (or (< (+ (select .cse1 |c_~#cache~0.offset|) 1) v_ArrVal_1577) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse1 |c_~#cache~0.offset| v_ArrVal_1577) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1578) |c_~#cache~0.offset|) 2147483647)))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-26 22:25:54,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:02,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:04,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:21,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 22:26:24,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:31,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:35,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:40,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:42,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:44,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:48,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:50,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:53,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-26 22:26:58,887 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 22:26:58,887 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 22:26:59,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 22:26:59,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 15 remaining) [2023-08-26 22:26:59,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-26 22:27:00,030 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 [2023-08-26 22:27:00,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-26 22:27:00,101 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 22:27:00,103 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2023-08-26 22:27:00,103 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2023-08-26 22:27:00,103 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2023-08-26 22:27:00,103 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2023-08-26 22:27:00,103 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2023-08-26 22:27:00,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2023-08-26 22:27:00,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2023-08-26 22:27:00,105 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 22:27:00,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 22:27:00,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 22:27:00,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 10:27:00 BasicIcfg [2023-08-26 22:27:00,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 22:27:00,112 INFO L158 Benchmark]: Toolchain (without parser) took 846347.45ms. Allocated memory was 350.2MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 325.0MB in the beginning and 1.3GB in the end (delta: -973.5MB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 22:27:00,113 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 350.2MB. Free memory is still 326.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 22:27:00,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.53ms. Allocated memory is still 350.2MB. Free memory was 324.6MB in the beginning and 297.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 22:27:00,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.85ms. Allocated memory is still 350.2MB. Free memory was 297.2MB in the beginning and 294.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 22:27:00,113 INFO L158 Benchmark]: Boogie Preprocessor took 45.89ms. Allocated memory is still 350.2MB. Free memory was 294.7MB in the beginning and 293.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 22:27:00,114 INFO L158 Benchmark]: RCFGBuilder took 469.43ms. Allocated memory is still 350.2MB. Free memory was 293.1MB in the beginning and 278.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 22:27:00,114 INFO L158 Benchmark]: TraceAbstraction took 845207.27ms. Allocated memory was 350.2MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 278.0MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 22:27:00,115 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 350.2MB. Free memory is still 326.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 555.53ms. Allocated memory is still 350.2MB. Free memory was 324.6MB in the beginning and 297.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.85ms. Allocated memory is still 350.2MB. Free memory was 297.2MB in the beginning and 294.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.89ms. Allocated memory is still 350.2MB. Free memory was 294.7MB in the beginning and 293.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 469.43ms. Allocated memory is still 350.2MB. Free memory was 293.1MB in the beginning and 278.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 845207.27ms. Allocated memory was 350.2MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 278.0MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 90 PlacesBefore, 27 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 2108 CoEnabledTransitionPairs, 4 FixpointIterations, 23 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 2651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1847, independent: 1758, independent conditional: 0, independent unconditional: 1758, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1147, independent: 1122, independent conditional: 0, independent unconditional: 1122, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1847, independent: 636, independent conditional: 0, independent unconditional: 636, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 1147, unknown conditional: 0, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 119 locations, 15 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: 845.0s, OverallIterations: 33, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 745.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 308 mSolverCounterUnknown, 3970 SdHoareTripleChecker+Valid, 309.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3970 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 305.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2895 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 922 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16678 IncrementalHoareTripleChecker+Invalid, 20803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 922 mSolverCounterUnsat, 0 mSDtfsCounter, 16678 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 358 SyntacticMatches, 16 SemanticMatches, 1007 ConstructedPredicates, 23 IntricatePredicates, 2 DeprecatedPredicates, 26754 ImplicationChecksByTransitivity, 464.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45933occurred in iteration=32, InterpolantAutomatonStates: 712, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 91.1s InterpolantComputationTime, 964 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1175 ConstructedInterpolants, 281 QuantifiedInterpolants, 18694 SizeOfPredicates, 196 NumberOfNonLiveVariables, 2863 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 62 InterpolantComputations, 20 PerfectInterpolantSequences, 2889/3012 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 could not prove your program: Timeout Completed graceful shutdown