./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:51:31,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:51:32,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 03:51:32,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:51:32,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:51:32,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:51:32,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:51:32,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:51:32,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:51:32,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:51:32,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:51:32,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:51:32,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:51:32,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:51:32,068 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:51:32,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:51:32,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 03:51:32,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:51:32,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:51:32,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:51:32,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:51:32,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 03:51:32,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:51:32,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 03:51:32,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:51:32,071 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 03:51:32,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:51:32,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:51:32,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 03:51:32,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:51:32,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:51:32,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:51:32,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:51:32,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:51:32,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:51:32,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:51:32,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:51:32,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 03:51:32,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:51:32,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:51:32,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:51:32,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:51:32,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:51:32,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:51:32,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2024-11-17 03:51:32,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:51:32,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:51:32,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:51:32,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:51:32,303 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:51:32,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2024-11-17 03:51:33,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:51:33,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:51:33,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2024-11-17 03:51:33,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3854ce7ad/6116587cc6464c86ac41fdd6fb3a3eb8/FLAG8b79b7956 [2024-11-17 03:51:34,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3854ce7ad/6116587cc6464c86ac41fdd6fb3a3eb8 [2024-11-17 03:51:34,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:51:34,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:51:34,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:51:34,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:51:34,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:51:34,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39924ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34, skipping insertion in model container [2024-11-17 03:51:34,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:51:34,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:51:34,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:51:34,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:51:34,440 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:51:34,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34 WrapperNode [2024-11-17 03:51:34,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:51:34,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:51:34,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:51:34,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:51:34,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,483 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2024-11-17 03:51:34,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:51:34,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:51:34,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:51:34,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:51:34,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:51:34,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:51:34,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:51:34,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:51:34,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:51:34,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (1/1) ... [2024-11-17 03:51:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:51:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:34,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:51:34,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:51:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:51:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:51:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:51:34,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:51:34,665 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:51:34,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:51:35,045 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-17 03:51:35,047 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:51:35,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:51:35,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:51:35,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:51:35 BoogieIcfgContainer [2024-11-17 03:51:35,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:51:35,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:51:35,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:51:35,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:51:35,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:51:34" (1/3) ... [2024-11-17 03:51:35,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f866cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:51:35, skipping insertion in model container [2024-11-17 03:51:35,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:51:34" (2/3) ... [2024-11-17 03:51:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f866cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:51:35, skipping insertion in model container [2024-11-17 03:51:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:51:35" (3/3) ... [2024-11-17 03:51:35,093 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2024-11-17 03:51:35,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:51:35,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-17 03:51:35,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:51:35,162 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@66676e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:51:35,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-17 03:51:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 149 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 03:51:35,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:35,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 03:51:35,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:35,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 6832991, now seen corresponding path program 1 times [2024-11-17 03:51:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:35,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210090060] [2024-11-17 03:51:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:51:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210090060] [2024-11-17 03:51:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210090060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:51:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914076632] [2024-11-17 03:51:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:35,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:51:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:35,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:51:35,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:51:35,327 INFO L87 Difference]: Start difference. First operand has 150 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 149 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:35,352 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2024-11-17 03:51:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:51:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 03:51:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:35,361 INFO L225 Difference]: With dead ends: 187 [2024-11-17 03:51:35,361 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 03:51:35,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:51:35,366 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:35,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:51:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 03:51:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 03:51:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2024-11-17 03:51:35,415 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 4 [2024-11-17 03:51:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:35,415 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2024-11-17 03:51:35,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2024-11-17 03:51:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 03:51:35,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:35,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:35,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:51:35,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -41233291, now seen corresponding path program 1 times [2024-11-17 03:51:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060662673] [2024-11-17 03:51:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:51:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060662673] [2024-11-17 03:51:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060662673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:51:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276341421] [2024-11-17 03:51:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:35,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:51:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:35,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:51:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:35,644 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:35,787 INFO L93 Difference]: Finished difference Result 201 states and 276 transitions. [2024-11-17 03:51:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:51:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 03:51:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:35,790 INFO L225 Difference]: With dead ends: 201 [2024-11-17 03:51:35,790 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 03:51:35,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:35,791 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:35,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 181 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 03:51:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-17 03:51:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.28) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2024-11-17 03:51:35,808 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 21 [2024-11-17 03:51:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:35,808 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2024-11-17 03:51:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2024-11-17 03:51:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 03:51:35,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:35,809 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:35,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:51:35,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:35,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1088264836, now seen corresponding path program 1 times [2024-11-17 03:51:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:35,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027201250] [2024-11-17 03:51:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:51:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027201250] [2024-11-17 03:51:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027201250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:35,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:51:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032325134] [2024-11-17 03:51:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:35,974 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:36,158 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2024-11-17 03:51:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:51:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-17 03:51:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:36,160 INFO L225 Difference]: With dead ends: 280 [2024-11-17 03:51:36,163 INFO L226 Difference]: Without dead ends: 211 [2024-11-17 03:51:36,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:36,164 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:36,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 250 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-17 03:51:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 155. [2024-11-17 03:51:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 154 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2024-11-17 03:51:36,174 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 30 [2024-11-17 03:51:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2024-11-17 03:51:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2024-11-17 03:51:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 03:51:36,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:36,176 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:51:36,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash -779179533, now seen corresponding path program 1 times [2024-11-17 03:51:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596397973] [2024-11-17 03:51:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 03:51:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596397973] [2024-11-17 03:51:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596397973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:36,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:51:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514905917] [2024-11-17 03:51:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:36,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:36,295 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:36,418 INFO L93 Difference]: Finished difference Result 401 states and 520 transitions. [2024-11-17 03:51:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-17 03:51:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:36,420 INFO L225 Difference]: With dead ends: 401 [2024-11-17 03:51:36,420 INFO L226 Difference]: Without dead ends: 278 [2024-11-17 03:51:36,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:36,422 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 131 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:36,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 375 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-17 03:51:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 172. [2024-11-17 03:51:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.2923976608187135) internal successors, (221), 171 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2024-11-17 03:51:36,438 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 39 [2024-11-17 03:51:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:36,438 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2024-11-17 03:51:36,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2024-11-17 03:51:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 03:51:36,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:36,440 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:51:36,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1982968911, now seen corresponding path program 1 times [2024-11-17 03:51:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957741087] [2024-11-17 03:51:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 03:51:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957741087] [2024-11-17 03:51:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957741087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:36,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:51:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198257529] [2024-11-17 03:51:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:36,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:36,601 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:36,725 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2024-11-17 03:51:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:36,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-17 03:51:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:36,726 INFO L225 Difference]: With dead ends: 409 [2024-11-17 03:51:36,726 INFO L226 Difference]: Without dead ends: 286 [2024-11-17 03:51:36,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:36,728 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:36,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 364 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-17 03:51:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2024-11-17 03:51:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2727272727272727) internal successors, (238), 187 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 238 transitions. [2024-11-17 03:51:36,743 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 238 transitions. Word has length 43 [2024-11-17 03:51:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:36,747 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 238 transitions. [2024-11-17 03:51:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 238 transitions. [2024-11-17 03:51:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 03:51:36,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:36,749 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:51:36,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash 769530539, now seen corresponding path program 1 times [2024-11-17 03:51:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640124837] [2024-11-17 03:51:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:51:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640124837] [2024-11-17 03:51:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640124837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308327789] [2024-11-17 03:51:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:36,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:36,862 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) [2024-11-17 03:51:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 03:51:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:36,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:51:36,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 03:51:36,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308327789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:36,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 03:51:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815993179] [2024-11-17 03:51:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:36,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:51:36,982 INFO L87 Difference]: Start difference. First operand 188 states and 238 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:37,123 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2024-11-17 03:51:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-17 03:51:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:37,127 INFO L225 Difference]: With dead ends: 369 [2024-11-17 03:51:37,127 INFO L226 Difference]: Without dead ends: 249 [2024-11-17 03:51:37,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:51:37,128 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 56 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:37,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 305 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-17 03:51:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 223. [2024-11-17 03:51:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 222 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2024-11-17 03:51:37,140 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 47 [2024-11-17 03:51:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:37,141 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2024-11-17 03:51:37,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2024-11-17 03:51:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 03:51:37,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:37,145 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:37,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 03:51:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 03:51:37,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2103895374, now seen corresponding path program 1 times [2024-11-17 03:51:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562497826] [2024-11-17 03:51:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:51:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562497826] [2024-11-17 03:51:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562497826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207146350] [2024-11-17 03:51:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:37,480 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) [2024-11-17 03:51:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 03:51:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:37,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:51:37,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 03:51:37,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207146350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:37,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-17 03:51:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439735248] [2024-11-17 03:51:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:37,586 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:37,714 INFO L93 Difference]: Finished difference Result 439 states and 574 transitions. [2024-11-17 03:51:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:37,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-17 03:51:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:37,715 INFO L225 Difference]: With dead ends: 439 [2024-11-17 03:51:37,716 INFO L226 Difference]: Without dead ends: 284 [2024-11-17 03:51:37,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:37,716 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:37,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 305 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-17 03:51:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2024-11-17 03:51:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.2430278884462151) internal successors, (312), 251 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 312 transitions. [2024-11-17 03:51:37,730 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 312 transitions. Word has length 56 [2024-11-17 03:51:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:37,731 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 312 transitions. [2024-11-17 03:51:37,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 312 transitions. [2024-11-17 03:51:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 03:51:37,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:37,732 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:37,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 03:51:37,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-17 03:51:37,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 416048681, now seen corresponding path program 1 times [2024-11-17 03:51:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36240198] [2024-11-17 03:51:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-17 03:51:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:37,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36240198] [2024-11-17 03:51:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36240198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:51:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377038746] [2024-11-17 03:51:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:51:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:51:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:37,997 INFO L87 Difference]: Start difference. First operand 252 states and 312 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:38,010 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2024-11-17 03:51:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:51:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-17 03:51:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:38,011 INFO L225 Difference]: With dead ends: 307 [2024-11-17 03:51:38,012 INFO L226 Difference]: Without dead ends: 219 [2024-11-17 03:51:38,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:38,012 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:38,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 259 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:51:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-17 03:51:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-17 03:51:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 218 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) [2024-11-17 03:51:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2024-11-17 03:51:38,020 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 65 [2024-11-17 03:51:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:38,020 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2024-11-17 03:51:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2024-11-17 03:51:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 03:51:38,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:38,021 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:38,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:51:38,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1470786825, now seen corresponding path program 1 times [2024-11-17 03:51:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004430728] [2024-11-17 03:51:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 03:51:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004430728] [2024-11-17 03:51:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004430728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:51:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968050314] [2024-11-17 03:51:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:38,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:51:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:51:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:38,129 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:38,250 INFO L93 Difference]: Finished difference Result 558 states and 690 transitions. [2024-11-17 03:51:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:51:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-17 03:51:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:38,252 INFO L225 Difference]: With dead ends: 558 [2024-11-17 03:51:38,253 INFO L226 Difference]: Without dead ends: 404 [2024-11-17 03:51:38,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:38,253 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:38,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 275 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-17 03:51:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2024-11-17 03:51:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.2313432835820894) internal successors, (330), 268 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 330 transitions. [2024-11-17 03:51:38,263 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 330 transitions. Word has length 77 [2024-11-17 03:51:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:38,263 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 330 transitions. [2024-11-17 03:51:38,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 330 transitions. [2024-11-17 03:51:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 03:51:38,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:38,265 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:38,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:51:38,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash -418312034, now seen corresponding path program 1 times [2024-11-17 03:51:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851435993] [2024-11-17 03:51:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 03:51:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851435993] [2024-11-17 03:51:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851435993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:51:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849954827] [2024-11-17 03:51:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:38,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:38,412 INFO L87 Difference]: Start difference. First operand 269 states and 330 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:38,466 INFO L93 Difference]: Finished difference Result 603 states and 741 transitions. [2024-11-17 03:51:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-17 03:51:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:38,468 INFO L225 Difference]: With dead ends: 603 [2024-11-17 03:51:38,468 INFO L226 Difference]: Without dead ends: 399 [2024-11-17 03:51:38,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:38,469 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 80 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:38,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 498 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:51:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-17 03:51:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 291. [2024-11-17 03:51:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.2551724137931035) internal successors, (364), 290 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 364 transitions. [2024-11-17 03:51:38,476 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 364 transitions. Word has length 80 [2024-11-17 03:51:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:38,477 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 364 transitions. [2024-11-17 03:51:38,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 364 transitions. [2024-11-17 03:51:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:51:38,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:38,478 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:51:38,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1713377239, now seen corresponding path program 1 times [2024-11-17 03:51:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197787749] [2024-11-17 03:51:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 03:51:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197787749] [2024-11-17 03:51:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197787749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137543567] [2024-11-17 03:51:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:38,555 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) [2024-11-17 03:51:38,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 03:51:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:38,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:51:38,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-17 03:51:38,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137543567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-17 03:51:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900462783] [2024-11-17 03:51:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:38,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:38,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:38,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:38,673 INFO L87 Difference]: Start difference. First operand 291 states and 364 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:38,745 INFO L93 Difference]: Finished difference Result 766 states and 963 transitions. [2024-11-17 03:51:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-17 03:51:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:38,747 INFO L225 Difference]: With dead ends: 766 [2024-11-17 03:51:38,747 INFO L226 Difference]: Without dead ends: 540 [2024-11-17 03:51:38,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:51:38,748 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 44 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:38,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 308 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-17 03:51:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 457. [2024-11-17 03:51:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.2587719298245614) internal successors, (574), 456 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 574 transitions. [2024-11-17 03:51:38,759 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 574 transitions. Word has length 87 [2024-11-17 03:51:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:38,760 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 574 transitions. [2024-11-17 03:51:38,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 574 transitions. [2024-11-17 03:51:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:51:38,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:38,761 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:38,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 03:51:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:38,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 995708369, now seen corresponding path program 1 times [2024-11-17 03:51:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962746897] [2024-11-17 03:51:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 03:51:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962746897] [2024-11-17 03:51:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962746897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:51:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930263330] [2024-11-17 03:51:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:51:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:51:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:51:39,087 INFO L87 Difference]: Start difference. First operand 457 states and 574 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:39,247 INFO L93 Difference]: Finished difference Result 1202 states and 1507 transitions. [2024-11-17 03:51:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:51:39,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-17 03:51:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:39,249 INFO L225 Difference]: With dead ends: 1202 [2024-11-17 03:51:39,249 INFO L226 Difference]: Without dead ends: 744 [2024-11-17 03:51:39,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:39,250 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 189 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:39,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 291 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-17 03:51:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 644. [2024-11-17 03:51:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.2379471228615864) internal successors, (796), 643 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 796 transitions. [2024-11-17 03:51:39,262 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 796 transitions. Word has length 87 [2024-11-17 03:51:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:39,263 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 796 transitions. [2024-11-17 03:51:39,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 796 transitions. [2024-11-17 03:51:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:51:39,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:39,264 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:39,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:51:39,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1628637905, now seen corresponding path program 1 times [2024-11-17 03:51:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123038641] [2024-11-17 03:51:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 03:51:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123038641] [2024-11-17 03:51:39,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123038641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:39,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:39,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:51:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916682301] [2024-11-17 03:51:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:39,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:51:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:51:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:51:39,355 INFO L87 Difference]: Start difference. First operand 644 states and 796 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:39,519 INFO L93 Difference]: Finished difference Result 1554 states and 1913 transitions. [2024-11-17 03:51:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:51:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-17 03:51:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:39,522 INFO L225 Difference]: With dead ends: 1554 [2024-11-17 03:51:39,522 INFO L226 Difference]: Without dead ends: 918 [2024-11-17 03:51:39,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:39,523 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 245 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:39,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 286 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-17 03:51:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 809. [2024-11-17 03:51:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.2252475247524752) internal successors, (990), 808 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 990 transitions. [2024-11-17 03:51:39,540 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 990 transitions. Word has length 87 [2024-11-17 03:51:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 990 transitions. [2024-11-17 03:51:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 990 transitions. [2024-11-17 03:51:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 03:51:39,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:39,542 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:39,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:51:39,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 95324053, now seen corresponding path program 1 times [2024-11-17 03:51:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:39,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121667384] [2024-11-17 03:51:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:51:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121667384] [2024-11-17 03:51:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121667384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166869964] [2024-11-17 03:51:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:39,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:39,657 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) [2024-11-17 03:51:39,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 03:51:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:39,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:51:39,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 03:51:39,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:51:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166869964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:39,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-17 03:51:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995701282] [2024-11-17 03:51:39,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:51:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:39,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:51:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:51:39,889 INFO L87 Difference]: Start difference. First operand 809 states and 990 transitions. Second operand has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:41,197 INFO L93 Difference]: Finished difference Result 4958 states and 5922 transitions. [2024-11-17 03:51:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-17 03:51:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-17 03:51:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:41,207 INFO L225 Difference]: With dead ends: 4958 [2024-11-17 03:51:41,207 INFO L226 Difference]: Without dead ends: 4033 [2024-11-17 03:51:41,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-11-17 03:51:41,210 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 796 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:41,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1752 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 03:51:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2024-11-17 03:51:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 1022. [2024-11-17 03:51:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 1.356513222331048) internal successors, (1385), 1021 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1385 transitions. [2024-11-17 03:51:41,245 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1385 transitions. Word has length 94 [2024-11-17 03:51:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1385 transitions. [2024-11-17 03:51:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1385 transitions. [2024-11-17 03:51:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 03:51:41,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:41,247 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:41,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 03:51:41,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:41,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash 458976550, now seen corresponding path program 1 times [2024-11-17 03:51:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215736720] [2024-11-17 03:51:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 03:51:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215736720] [2024-11-17 03:51:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215736720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:51:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481706818] [2024-11-17 03:51:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:51:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:51:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:41,583 INFO L87 Difference]: Start difference. First operand 1022 states and 1385 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:41,860 INFO L93 Difference]: Finished difference Result 2408 states and 3251 transitions. [2024-11-17 03:51:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:51:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-17 03:51:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:41,864 INFO L225 Difference]: With dead ends: 2408 [2024-11-17 03:51:41,864 INFO L226 Difference]: Without dead ends: 1324 [2024-11-17 03:51:41,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:51:41,866 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 196 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:41,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 487 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-17 03:51:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1223. [2024-11-17 03:51:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 1.358428805237316) internal successors, (1660), 1222 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1660 transitions. [2024-11-17 03:51:41,899 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1660 transitions. Word has length 94 [2024-11-17 03:51:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:41,899 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1660 transitions. [2024-11-17 03:51:41,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1660 transitions. [2024-11-17 03:51:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 03:51:41,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:41,900 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:41,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:51:41,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:41,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1426140204, now seen corresponding path program 1 times [2024-11-17 03:51:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981093362] [2024-11-17 03:51:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-17 03:51:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981093362] [2024-11-17 03:51:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981093362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:42,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:51:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245008459] [2024-11-17 03:51:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:51:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:51:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:42,010 INFO L87 Difference]: Start difference. First operand 1223 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:42,265 INFO L93 Difference]: Finished difference Result 2745 states and 3720 transitions. [2024-11-17 03:51:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:51:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-17 03:51:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:42,269 INFO L225 Difference]: With dead ends: 2745 [2024-11-17 03:51:42,269 INFO L226 Difference]: Without dead ends: 1510 [2024-11-17 03:51:42,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:51:42,271 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 289 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:42,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 390 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-17 03:51:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1401. [2024-11-17 03:51:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.3628571428571428) internal successors, (1908), 1400 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1908 transitions. [2024-11-17 03:51:42,321 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1908 transitions. Word has length 94 [2024-11-17 03:51:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:42,322 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1908 transitions. [2024-11-17 03:51:42,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1908 transitions. [2024-11-17 03:51:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 03:51:42,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:42,323 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:42,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 03:51:42,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:42,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -54900597, now seen corresponding path program 1 times [2024-11-17 03:51:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422447416] [2024-11-17 03:51:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-17 03:51:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422447416] [2024-11-17 03:51:42,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422447416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:42,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:42,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:51:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956908740] [2024-11-17 03:51:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:51:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:51:42,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:42,453 INFO L87 Difference]: Start difference. First operand 1401 states and 1908 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:42,644 INFO L93 Difference]: Finished difference Result 4329 states and 5895 transitions. [2024-11-17 03:51:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:51:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-17 03:51:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:42,654 INFO L225 Difference]: With dead ends: 4329 [2024-11-17 03:51:42,654 INFO L226 Difference]: Without dead ends: 4118 [2024-11-17 03:51:42,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:42,655 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 260 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:42,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 515 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2024-11-17 03:51:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 1401. [2024-11-17 03:51:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.3628571428571428) internal successors, (1908), 1400 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1908 transitions. [2024-11-17 03:51:42,701 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1908 transitions. Word has length 101 [2024-11-17 03:51:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:42,702 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1908 transitions. [2024-11-17 03:51:42,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1908 transitions. [2024-11-17 03:51:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 03:51:42,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:42,703 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:51:42,703 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash 544365007, now seen corresponding path program 1 times [2024-11-17 03:51:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:42,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100189960] [2024-11-17 03:51:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-17 03:51:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100189960] [2024-11-17 03:51:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100189960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:42,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:51:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750727357] [2024-11-17 03:51:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:51:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:42,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:51:42,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:51:42,815 INFO L87 Difference]: Start difference. First operand 1401 states and 1908 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:43,021 INFO L93 Difference]: Finished difference Result 4318 states and 5880 transitions. [2024-11-17 03:51:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:51:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-17 03:51:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:43,032 INFO L225 Difference]: With dead ends: 4318 [2024-11-17 03:51:43,032 INFO L226 Difference]: Without dead ends: 4097 [2024-11-17 03:51:43,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:43,034 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 214 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:43,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 472 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-11-17 03:51:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 1401. [2024-11-17 03:51:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.3628571428571428) internal successors, (1908), 1400 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1908 transitions. [2024-11-17 03:51:43,087 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1908 transitions. Word has length 101 [2024-11-17 03:51:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:43,088 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1908 transitions. [2024-11-17 03:51:43,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1908 transitions. [2024-11-17 03:51:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 03:51:43,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:43,089 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:51:43,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1137080277, now seen corresponding path program 1 times [2024-11-17 03:51:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540822553] [2024-11-17 03:51:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 03:51:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540822553] [2024-11-17 03:51:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540822553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338693434] [2024-11-17 03:51:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:43,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:43,225 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) [2024-11-17 03:51:43,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 03:51:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:43,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:51:43,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-17 03:51:43,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338693434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:43,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-17 03:51:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464716622] [2024-11-17 03:51:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:43,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:43,336 INFO L87 Difference]: Start difference. First operand 1401 states and 1908 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:43,428 INFO L93 Difference]: Finished difference Result 2947 states and 4011 transitions. [2024-11-17 03:51:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-17 03:51:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:43,435 INFO L225 Difference]: With dead ends: 2947 [2024-11-17 03:51:43,435 INFO L226 Difference]: Without dead ends: 2693 [2024-11-17 03:51:43,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:51:43,436 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 66 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 237 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2024-11-17 03:51:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2106. [2024-11-17 03:51:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.3667458432304038) internal successors, (2877), 2105 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2877 transitions. [2024-11-17 03:51:43,491 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 2877 transitions. Word has length 104 [2024-11-17 03:51:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:43,492 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 2877 transitions. [2024-11-17 03:51:43,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2877 transitions. [2024-11-17 03:51:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 03:51:43,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:43,494 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:43,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 03:51:43,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:43,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:43,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1979927455, now seen corresponding path program 1 times [2024-11-17 03:51:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:43,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34150221] [2024-11-17 03:51:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-17 03:51:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34150221] [2024-11-17 03:51:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34150221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091529411] [2024-11-17 03:51:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:43,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:43,816 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) [2024-11-17 03:51:43,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 03:51:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:43,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:51:43,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-17 03:51:43,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 03:51:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091529411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:44,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2024-11-17 03:51:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239504246] [2024-11-17 03:51:44,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:51:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:51:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:51:44,058 INFO L87 Difference]: Start difference. First operand 2106 states and 2877 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:44,767 INFO L93 Difference]: Finished difference Result 8509 states and 11991 transitions. [2024-11-17 03:51:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 03:51:44,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-17 03:51:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:44,783 INFO L225 Difference]: With dead ends: 8509 [2024-11-17 03:51:44,783 INFO L226 Difference]: Without dead ends: 6440 [2024-11-17 03:51:44,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-17 03:51:44,791 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 522 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:44,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 817 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 03:51:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states. [2024-11-17 03:51:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 4928. [2024-11-17 03:51:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4927 states have (on average 1.2813070834179014) internal successors, (6313), 4927 states have internal predecessors, (6313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 6313 transitions. [2024-11-17 03:51:44,967 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 6313 transitions. Word has length 104 [2024-11-17 03:51:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 6313 transitions. [2024-11-17 03:51:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 6313 transitions. [2024-11-17 03:51:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 03:51:44,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:44,970 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:44,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 03:51:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:45,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -82468825, now seen corresponding path program 1 times [2024-11-17 03:51:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918665020] [2024-11-17 03:51:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-17 03:51:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918665020] [2024-11-17 03:51:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918665020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:51:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871917304] [2024-11-17 03:51:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:51:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:51:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:45,273 INFO L87 Difference]: Start difference. First operand 4928 states and 6313 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:45,305 INFO L93 Difference]: Finished difference Result 4946 states and 6334 transitions. [2024-11-17 03:51:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:51:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-17 03:51:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:45,309 INFO L225 Difference]: With dead ends: 4946 [2024-11-17 03:51:45,309 INFO L226 Difference]: Without dead ends: 1194 [2024-11-17 03:51:45,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:51:45,312 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:51:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-17 03:51:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2024-11-17 03:51:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.2095557418273262) internal successors, (1443), 1193 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1443 transitions. [2024-11-17 03:51:45,381 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1443 transitions. Word has length 105 [2024-11-17 03:51:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1443 transitions. [2024-11-17 03:51:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1443 transitions. [2024-11-17 03:51:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 03:51:45,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:45,382 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:45,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 03:51:45,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:45,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -103109781, now seen corresponding path program 1 times [2024-11-17 03:51:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763463976] [2024-11-17 03:51:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-17 03:51:45,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:45,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763463976] [2024-11-17 03:51:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763463976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:51:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:51:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882933833] [2024-11-17 03:51:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:51:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:51:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:51:45,484 INFO L87 Difference]: Start difference. First operand 1194 states and 1443 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:45,747 INFO L93 Difference]: Finished difference Result 2619 states and 3167 transitions. [2024-11-17 03:51:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:51:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-17 03:51:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:45,754 INFO L225 Difference]: With dead ends: 2619 [2024-11-17 03:51:45,755 INFO L226 Difference]: Without dead ends: 2432 [2024-11-17 03:51:45,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:45,756 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 314 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:45,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 713 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-17 03:51:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1194. [2024-11-17 03:51:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.2095557418273262) internal successors, (1443), 1193 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1443 transitions. [2024-11-17 03:51:45,791 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1443 transitions. Word has length 105 [2024-11-17 03:51:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1443 transitions. [2024-11-17 03:51:45,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1443 transitions. [2024-11-17 03:51:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 03:51:45,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:45,793 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:45,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 03:51:45,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:45,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash -137077832, now seen corresponding path program 1 times [2024-11-17 03:51:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423900104] [2024-11-17 03:51:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 44 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-17 03:51:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423900104] [2024-11-17 03:51:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423900104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076220128] [2024-11-17 03:51:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:45,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:45,998 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) [2024-11-17 03:51:45,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 03:51:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:46,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 03:51:46,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-17 03:51:46,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076220128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:46,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:46,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-17 03:51:46,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055444717] [2024-11-17 03:51:46,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:46,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:51:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:51:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:51:46,159 INFO L87 Difference]: Start difference. First operand 1194 states and 1443 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:46,358 INFO L93 Difference]: Finished difference Result 2601 states and 3148 transitions. [2024-11-17 03:51:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:51:46,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-17 03:51:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:46,361 INFO L225 Difference]: With dead ends: 2601 [2024-11-17 03:51:46,361 INFO L226 Difference]: Without dead ends: 1995 [2024-11-17 03:51:46,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:51:46,362 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 233 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:46,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1092 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-17 03:51:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1363. [2024-11-17 03:51:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1362 states have (on average 1.2063142437591776) internal successors, (1643), 1362 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1643 transitions. [2024-11-17 03:51:46,400 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1643 transitions. Word has length 108 [2024-11-17 03:51:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:46,400 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1643 transitions. [2024-11-17 03:51:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1643 transitions. [2024-11-17 03:51:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 03:51:46,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:46,402 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:46,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 03:51:46,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:46,603 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1776025423, now seen corresponding path program 1 times [2024-11-17 03:51:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496528854] [2024-11-17 03:51:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:46,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 03:51:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:46,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496528854] [2024-11-17 03:51:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496528854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:46,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456747959] [2024-11-17 03:51:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:46,768 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) [2024-11-17 03:51:46,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 03:51:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:46,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 03:51:46,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-17 03:51:46,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456747959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-17 03:51:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280163312] [2024-11-17 03:51:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:51:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:51:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:46,890 INFO L87 Difference]: Start difference. First operand 1363 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:47,005 INFO L93 Difference]: Finished difference Result 2147 states and 2591 transitions. [2024-11-17 03:51:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:51:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-17 03:51:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:47,009 INFO L225 Difference]: With dead ends: 2147 [2024-11-17 03:51:47,009 INFO L226 Difference]: Without dead ends: 1927 [2024-11-17 03:51:47,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:47,010 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:47,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 321 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-11-17 03:51:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1363. [2024-11-17 03:51:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1362 states have (on average 1.2063142437591776) internal successors, (1643), 1362 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1643 transitions. [2024-11-17 03:51:47,049 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1643 transitions. Word has length 108 [2024-11-17 03:51:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:47,050 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1643 transitions. [2024-11-17 03:51:47,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1643 transitions. [2024-11-17 03:51:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-17 03:51:47,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:47,052 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:47,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 03:51:47,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-17 03:51:47,253 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:47,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash 951420244, now seen corresponding path program 1 times [2024-11-17 03:51:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:47,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685090076] [2024-11-17 03:51:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 03:51:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685090076] [2024-11-17 03:51:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685090076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763410987] [2024-11-17 03:51:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:47,372 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) [2024-11-17 03:51:47,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 03:51:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:47,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:51:47,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-17 03:51:47,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:51:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763410987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:51:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:51:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-17 03:51:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889170079] [2024-11-17 03:51:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:51:47,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:51:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:51:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:47,490 INFO L87 Difference]: Start difference. First operand 1363 states and 1643 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:47,616 INFO L93 Difference]: Finished difference Result 2140 states and 2570 transitions. [2024-11-17 03:51:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:51:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-17 03:51:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:47,619 INFO L225 Difference]: With dead ends: 2140 [2024-11-17 03:51:47,619 INFO L226 Difference]: Without dead ends: 1735 [2024-11-17 03:51:47,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:51:47,620 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:47,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 238 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-11-17 03:51:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1728. [2024-11-17 03:51:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.204979733642154) internal successors, (2081), 1727 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2081 transitions. [2024-11-17 03:51:47,675 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2081 transitions. Word has length 111 [2024-11-17 03:51:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2081 transitions. [2024-11-17 03:51:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2081 transitions. [2024-11-17 03:51:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-17 03:51:47,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:47,677 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:47,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 03:51:47,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-17 03:51:47,878 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:47,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 937289267, now seen corresponding path program 1 times [2024-11-17 03:51:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549808272] [2024-11-17 03:51:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 03:51:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549808272] [2024-11-17 03:51:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549808272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560240676] [2024-11-17 03:51:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:48,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:48,021 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) [2024-11-17 03:51:48,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 03:51:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:48,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 03:51:48,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-17 03:51:48,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 03:51:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560240676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:48,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 18 [2024-11-17 03:51:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112555843] [2024-11-17 03:51:48,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:48,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:51:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:51:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:51:48,385 INFO L87 Difference]: Start difference. First operand 1728 states and 2081 transitions. Second operand has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:49,337 INFO L93 Difference]: Finished difference Result 3418 states and 4118 transitions. [2024-11-17 03:51:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 03:51:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-17 03:51:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:49,340 INFO L225 Difference]: With dead ends: 3418 [2024-11-17 03:51:49,340 INFO L226 Difference]: Without dead ends: 1561 [2024-11-17 03:51:49,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=361, Invalid=1121, Unknown=0, NotChecked=0, Total=1482 [2024-11-17 03:51:49,342 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1462 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:49,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 962 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:51:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2024-11-17 03:51:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1320. [2024-11-17 03:51:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.1933282789992419) internal successors, (1574), 1319 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1574 transitions. [2024-11-17 03:51:49,385 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1574 transitions. Word has length 112 [2024-11-17 03:51:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1574 transitions. [2024-11-17 03:51:49,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1574 transitions. [2024-11-17 03:51:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-17 03:51:49,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:49,387 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:49,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 03:51:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-17 03:51:49,591 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1297659206, now seen corresponding path program 1 times [2024-11-17 03:51:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181272229] [2024-11-17 03:51:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 44 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-17 03:51:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181272229] [2024-11-17 03:51:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181272229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305842231] [2024-11-17 03:51:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:49,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:49,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:49,791 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) [2024-11-17 03:51:49,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 03:51:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:49,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 03:51:49,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 03:51:50,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 03:51:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305842231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:50,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2024-11-17 03:51:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974545569] [2024-11-17 03:51:50,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 03:51:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 03:51:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-17 03:51:50,522 INFO L87 Difference]: Start difference. First operand 1320 states and 1574 transitions. Second operand has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:53,590 INFO L93 Difference]: Finished difference Result 8538 states and 9774 transitions. [2024-11-17 03:51:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-17 03:51:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-17 03:51:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:53,602 INFO L225 Difference]: With dead ends: 8538 [2024-11-17 03:51:53,602 INFO L226 Difference]: Without dead ends: 7166 [2024-11-17 03:51:53,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2078, Invalid=8634, Unknown=0, NotChecked=0, Total=10712 [2024-11-17 03:51:53,606 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2311 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:53,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 2145 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:51:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2024-11-17 03:51:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 2652. [2024-11-17 03:51:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 1.1572991324028667) internal successors, (3068), 2651 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3068 transitions. [2024-11-17 03:51:53,756 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3068 transitions. Word has length 115 [2024-11-17 03:51:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 3068 transitions. [2024-11-17 03:51:53,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3068 transitions. [2024-11-17 03:51:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-17 03:51:53,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:53,759 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:53,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-17 03:51:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 03:51:53,960 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1383433785, now seen corresponding path program 1 times [2024-11-17 03:51:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862229978] [2024-11-17 03:51:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 85 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 03:51:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862229978] [2024-11-17 03:51:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862229978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898416346] [2024-11-17 03:51:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:54,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:54,263 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) [2024-11-17 03:51:54,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 03:51:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:54,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 03:51:54,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 62 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:51:54,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:51:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898416346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:54,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-17 03:51:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613389386] [2024-11-17 03:51:54,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 03:51:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 03:51:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-17 03:51:54,678 INFO L87 Difference]: Start difference. First operand 2652 states and 3068 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:55,242 INFO L93 Difference]: Finished difference Result 5981 states and 6795 transitions. [2024-11-17 03:51:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 03:51:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-17 03:51:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:55,247 INFO L225 Difference]: With dead ends: 5981 [2024-11-17 03:51:55,247 INFO L226 Difference]: Without dead ends: 3365 [2024-11-17 03:51:55,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=957, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 03:51:55,250 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 858 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:55,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1164 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:51:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2024-11-17 03:51:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 2445. [2024-11-17 03:51:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2444 states have (on average 1.146481178396072) internal successors, (2802), 2444 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 2802 transitions. [2024-11-17 03:51:55,364 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 2802 transitions. Word has length 115 [2024-11-17 03:51:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 2802 transitions. [2024-11-17 03:51:55,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 2802 transitions. [2024-11-17 03:51:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-17 03:51:55,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:55,367 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:55,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 03:51:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 03:51:55,567 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2026135312, now seen corresponding path program 1 times [2024-11-17 03:51:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950377276] [2024-11-17 03:51:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 03:51:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950377276] [2024-11-17 03:51:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950377276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774258775] [2024-11-17 03:51:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:55,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:55,669 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) [2024-11-17 03:51:55,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 03:51:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:55,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:51:55,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 03:51:55,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 03:51:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774258775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:55,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-17 03:51:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296286328] [2024-11-17 03:51:55,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:51:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:51:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:51:55,892 INFO L87 Difference]: Start difference. First operand 2445 states and 2802 transitions. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:51:56,099 INFO L93 Difference]: Finished difference Result 4138 states and 4676 transitions. [2024-11-17 03:51:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:51:56,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-17 03:51:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:51:56,102 INFO L225 Difference]: With dead ends: 4138 [2024-11-17 03:51:56,102 INFO L226 Difference]: Without dead ends: 1204 [2024-11-17 03:51:56,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:51:56,107 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 169 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:51:56,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 682 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:51:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-17 03:51:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 878. [2024-11-17 03:51:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 1.1368301026225769) internal successors, (997), 877 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 997 transitions. [2024-11-17 03:51:56,138 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 997 transitions. Word has length 116 [2024-11-17 03:51:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:51:56,138 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 997 transitions. [2024-11-17 03:51:56,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:51:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 997 transitions. [2024-11-17 03:51:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-17 03:51:56,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:51:56,139 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:51:56,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 03:51:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-17 03:51:56,341 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:51:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:51:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -44224878, now seen corresponding path program 1 times [2024-11-17 03:51:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:51:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406302534] [2024-11-17 03:51:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:51:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 35 proven. 35 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-17 03:51:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:51:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406302534] [2024-11-17 03:51:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406302534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:51:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392567661] [2024-11-17 03:51:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:51:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:51:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:51:56,534 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) [2024-11-17 03:51:56,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 03:51:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:51:56,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 03:51:56,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:51:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-17 03:51:56,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:51:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-17 03:51:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392567661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:51:57,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:51:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2024-11-17 03:51:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46966737] [2024-11-17 03:51:57,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:51:57,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 03:51:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:51:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 03:51:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-17 03:51:57,715 INFO L87 Difference]: Start difference. First operand 878 states and 997 transitions. Second operand has 21 states, 21 states have (on average 12.761904761904763) internal successors, (268), 21 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:00,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-17 03:52:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:04,027 INFO L93 Difference]: Finished difference Result 3282 states and 3633 transitions. [2024-11-17 03:52:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-17 03:52:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.761904761904763) internal successors, (268), 21 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-17 03:52:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:04,031 INFO L225 Difference]: With dead ends: 3282 [2024-11-17 03:52:04,031 INFO L226 Difference]: Without dead ends: 1448 [2024-11-17 03:52:04,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1310, Invalid=5010, Unknown=0, NotChecked=0, Total=6320 [2024-11-17 03:52:04,035 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1219 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:04,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 2713 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-17 03:52:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-17 03:52:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 903. [2024-11-17 03:52:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.165188470066519) internal successors, (1051), 902 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1051 transitions. [2024-11-17 03:52:04,082 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1051 transitions. Word has length 122 [2024-11-17 03:52:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:04,082 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1051 transitions. [2024-11-17 03:52:04,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.761904761904763) internal successors, (268), 21 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1051 transitions. [2024-11-17 03:52:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-17 03:52:04,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:04,083 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:04,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-17 03:52:04,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:04,284 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:52:04,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2071373900, now seen corresponding path program 1 times [2024-11-17 03:52:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:04,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166321702] [2024-11-17 03:52:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 41 proven. 53 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:52:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166321702] [2024-11-17 03:52:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166321702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518435075] [2024-11-17 03:52:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:04,564 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) [2024-11-17 03:52:04,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 03:52:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:04,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:52:04,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 41 proven. 53 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:52:04,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 41 proven. 53 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-17 03:52:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518435075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:05,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-17 03:52:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206459593] [2024-11-17 03:52:05,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:52:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:52:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:52:05,761 INFO L87 Difference]: Start difference. First operand 903 states and 1051 transitions. Second operand has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:06,200 INFO L93 Difference]: Finished difference Result 1808 states and 2050 transitions. [2024-11-17 03:52:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 03:52:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-17 03:52:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:06,203 INFO L225 Difference]: With dead ends: 1808 [2024-11-17 03:52:06,203 INFO L226 Difference]: Without dead ends: 1798 [2024-11-17 03:52:06,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-17 03:52:06,204 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 253 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:06,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 2016 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 03:52:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-17 03:52:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 877. [2024-11-17 03:52:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 1.1689497716894977) internal successors, (1024), 876 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1024 transitions. [2024-11-17 03:52:06,244 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1024 transitions. Word has length 125 [2024-11-17 03:52:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1024 transitions. [2024-11-17 03:52:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1024 transitions. [2024-11-17 03:52:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-17 03:52:06,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:06,247 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:06,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-17 03:52:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:06,451 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-17 03:52:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1356541171, now seen corresponding path program 2 times [2024-11-17 03:52:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293650152] [2024-11-17 03:52:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:06,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:52:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:06,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:52:06,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:52:06,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-11-17 03:52:06,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-11-17 03:52:06,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-11-17 03:52:06,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-11-17 03:52:06,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-11-17 03:52:06,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-11-17 03:52:06,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-11-17 03:52:06,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-11-17 03:52:06,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-11-17 03:52:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-17 03:52:06,549 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:06,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:52:06,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:52:06 BoogieIcfgContainer [2024-11-17 03:52:06,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:52:06,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:52:06,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:52:06,611 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:52:06,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:51:35" (3/4) ... [2024-11-17 03:52:06,612 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 03:52:06,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:52:06,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:52:06,692 INFO L158 Benchmark]: Toolchain (without parser) took 32557.75ms. Allocated memory was 136.3MB in the beginning and 553.6MB in the end (delta: 417.3MB). Free memory was 66.0MB in the beginning and 508.3MB in the end (delta: -442.3MB). Peak memory consumption was 293.5MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,692 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:52:06,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.24ms. Allocated memory was 136.3MB in the beginning and 201.3MB in the end (delta: 65.0MB). Free memory was 65.7MB in the beginning and 167.6MB in the end (delta: -101.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.54ms. Allocated memory is still 201.3MB. Free memory was 167.6MB in the beginning and 163.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,694 INFO L158 Benchmark]: Boogie Preprocessor took 44.73ms. Allocated memory is still 201.3MB. Free memory was 163.4MB in the beginning and 160.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,694 INFO L158 Benchmark]: IcfgBuilder took 552.92ms. Allocated memory is still 201.3MB. Free memory was 160.3MB in the beginning and 129.9MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,694 INFO L158 Benchmark]: TraceAbstraction took 31525.38ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 128.8MB in the beginning and 193.3MB in the end (delta: -64.4MB). Peak memory consumption was 288.9MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,694 INFO L158 Benchmark]: Witness Printer took 80.66ms. Allocated memory is still 553.6MB. Free memory was 193.3MB in the beginning and 508.3MB in the end (delta: -315.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:06,695 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.24ms. Allocated memory was 136.3MB in the beginning and 201.3MB in the end (delta: 65.0MB). Free memory was 65.7MB in the beginning and 167.6MB in the end (delta: -101.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.54ms. Allocated memory is still 201.3MB. Free memory was 167.6MB in the beginning and 163.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.73ms. Allocated memory is still 201.3MB. Free memory was 163.4MB in the beginning and 160.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 552.92ms. Allocated memory is still 201.3MB. Free memory was 160.3MB in the beginning and 129.9MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31525.38ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 128.8MB in the beginning and 193.3MB in the end (delta: -64.4MB). Peak memory consumption was 288.9MB. Max. memory is 16.1GB. * Witness Printer took 80.66ms. Allocated memory is still 553.6MB. Free memory was 193.3MB in the beginning and 508.3MB in the end (delta: -315.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] EXPR partial_sum + b1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] partial_sum = partial_sum + b1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] EXPR partial_sum + b2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] partial_sum = partial_sum + b2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L104] EXPR i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] EXPR partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=255] [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L93] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L93] EXPR partial_sum + b3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=0, r1=0, r2=255] [L93] partial_sum = partial_sum + b3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=0, r1=0, r2=255] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L104] EXPR i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=255, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, i=4, r0=0, r1=0, r2=255, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, r0=0, r1=0, r2=255, r3=128] [L116] EXPR r1 << 8U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, r0=0, r1=0, r2=255, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, r2=255, r3=128] [L116] EXPR r2 << 16U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, r2=255, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115, r3=128] [L116] r3 << 24U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=1929424539, b1=7536814, b2=29440, b3=115] - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10707 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10707 mSDsluCounter, 20649 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15869 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9188 IncrementalHoareTripleChecker+Invalid, 9802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 4780 mSDtfsCounter, 9188 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2943 GetRequests, 2464 SyntacticMatches, 7 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7043 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4928occurred in iteration=20, InterpolantAutomatonStates: 421, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 21500 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 4306 NumberOfCodeBlocks, 4306 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 5030 ConstructedInterpolants, 15 QuantifiedInterpolants, 20627 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2986 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 54 InterpolantComputations, 23 PerfectInterpolantSequences, 3880/4678 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-17 03:52:06,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)