./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c -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 bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:53:33,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:53:33,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:53:33,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:53:33,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:53:33,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:53:33,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:53:33,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:53:33,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:53:33,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:53:33,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:53:33,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:53:33,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:53:33,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:53:33,322 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:53:33,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:53:33,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:53:33,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:53:33,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:53:33,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:53:33,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:53:33,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:53:33,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:53:33,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:53:33,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:53:33,327 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:53:33,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:53:33,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:53:33,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:53:33,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:53:33,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:53:33,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:53:33,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:53:33,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:53:33,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:53:33,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:53:33,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:53:33,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:53:33,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:53:33,331 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 -> bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 [2024-10-13 13:53:33,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:53:33,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:53:33,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:53:33,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:53:33,547 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:53:33,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2024-10-13 13:53:34,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:53:34,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:53:34,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2024-10-13 13:53:34,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241db1949/b73c0b78d05e448891233986a8b40055/FLAGfee23960a [2024-10-13 13:53:35,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241db1949/b73c0b78d05e448891233986a8b40055 [2024-10-13 13:53:35,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:53:35,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:53:35,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:53:35,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:53:35,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:53:35,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19adfe1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35, skipping insertion in model container [2024-10-13 13:53:35,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:53:35,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:53:35,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:53:35,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:53:35,559 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:53:35,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35 WrapperNode [2024-10-13 13:53:35,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:53:35,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:53:35,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:53:35,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:53:35,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,600 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-10-13 13:53:35,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:53:35,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:53:35,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:53:35,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:53:35,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,618 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-10-13 13:53:35,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:53:35,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:53:35,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:53:35,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:53:35,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (1/1) ... [2024-10-13 13:53:35,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:53:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:53:35,653 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-10-13 13:53:35,656 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-10-13 13:53:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:53:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:53:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:53:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:53:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:53:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:53:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:53:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:53:35,739 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:53:35,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:53:36,151 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-13 13:53:36,151 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:53:36,172 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:53:36,172 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:53:36,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:53:36 BoogieIcfgContainer [2024-10-13 13:53:36,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:53:36,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:53:36,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:53:36,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:53:36,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:53:35" (1/3) ... [2024-10-13 13:53:36,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6d9166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:53:36, skipping insertion in model container [2024-10-13 13:53:36,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:53:35" (2/3) ... [2024-10-13 13:53:36,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6d9166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:53:36, skipping insertion in model container [2024-10-13 13:53:36,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:53:36" (3/3) ... [2024-10-13 13:53:36,181 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound1.c [2024-10-13 13:53:36,195 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:53:36,196 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2024-10-13 13:53:36,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:53:36,251 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;@1ad092ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:53:36,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2024-10-13 13:53:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:53:36,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:36,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:53:36,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1162004414, now seen corresponding path program 1 times [2024-10-13 13:53:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133247277] [2024-10-13 13:53:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133247277] [2024-10-13 13:53:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133247277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:53:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426043651] [2024-10-13 13:53:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:53:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:53:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:53:36,413 INFO L87 Difference]: Start difference. First operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:53:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:36,446 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2024-10-13 13:53:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:53:36,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-13 13:53:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:36,455 INFO L225 Difference]: With dead ends: 359 [2024-10-13 13:53:36,456 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 13:53:36,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10-13 13:53:36,462 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:36,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:53:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 13:53:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-13 13:53:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:53:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2024-10-13 13:53:36,501 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2024-10-13 13:53:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:36,501 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2024-10-13 13:53:36,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:53:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2024-10-13 13:53:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:53:36,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:36,503 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:53:36,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:53:36,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1920324093, now seen corresponding path program 1 times [2024-10-13 13:53:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:36,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670693473] [2024-10-13 13:53:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670693473] [2024-10-13 13:53:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670693473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:53:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808928745] [2024-10-13 13:53:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:36,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:53:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:36,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:53:36,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:53:36,582 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:36,846 INFO L93 Difference]: Finished difference Result 308 states and 320 transitions. [2024-10-13 13:53:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:53:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-13 13:53:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:36,848 INFO L225 Difference]: With dead ends: 308 [2024-10-13 13:53:36,848 INFO L226 Difference]: Without dead ends: 252 [2024-10-13 13:53:36,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 13:53:36,849 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:36,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:53:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-13 13:53:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-13 13:53:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 168 states have (on average 1.505952380952381) internal successors, (253), 238 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 263 transitions. [2024-10-13 13:53:36,871 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 263 transitions. Word has length 14 [2024-10-13 13:53:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:36,872 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 263 transitions. [2024-10-13 13:53:36,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 263 transitions. [2024-10-13 13:53:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 13:53:36,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:36,873 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 13:53:36,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:53:36,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:36,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1713492121, now seen corresponding path program 1 times [2024-10-13 13:53:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:36,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825276700] [2024-10-13 13:53:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825276700] [2024-10-13 13:53:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825276700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:53:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90628990] [2024-10-13 13:53:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:53:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:53:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:53:37,007 INFO L87 Difference]: Start difference. First operand 246 states and 263 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:37,070 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-10-13 13:53:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:53:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-10-13 13:53:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:37,074 INFO L225 Difference]: With dead ends: 265 [2024-10-13 13:53:37,074 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 13:53:37,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 13:53:37,075 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:37,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 293 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:53:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 13:53:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2024-10-13 13:53:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 245 states have internal predecessors, (260), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2024-10-13 13:53:37,090 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 42 [2024-10-13 13:53:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:37,091 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2024-10-13 13:53:37,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2024-10-13 13:53:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 13:53:37,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:37,092 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 13:53:37,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:53:37,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1693457243, now seen corresponding path program 1 times [2024-10-13 13:53:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482146579] [2024-10-13 13:53:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482146579] [2024-10-13 13:53:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482146579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:37,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:53:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477306365] [2024-10-13 13:53:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:53:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:53:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:53:37,207 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:37,386 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2024-10-13 13:53:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:53:37,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-13 13:53:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:37,388 INFO L225 Difference]: With dead ends: 264 [2024-10-13 13:53:37,388 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 13:53:37,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-13 13:53:37,389 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:37,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:53:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 13:53:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-13 13:53:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.457142857142857) internal successors, (255), 245 states have internal predecessors, (255), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2024-10-13 13:53:37,398 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 44 [2024-10-13 13:53:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:37,398 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2024-10-13 13:53:37,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2024-10-13 13:53:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 13:53:37,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:37,399 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 13:53:37,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:53:37,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 957567089, now seen corresponding path program 1 times [2024-10-13 13:53:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211056704] [2024-10-13 13:53:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211056704] [2024-10-13 13:53:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211056704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:53:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694659941] [2024-10-13 13:53:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:53:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:53:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:53:37,471 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:37,821 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2024-10-13 13:53:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:53:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-13 13:53:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:37,823 INFO L225 Difference]: With dead ends: 263 [2024-10-13 13:53:37,823 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 13:53:37,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-13 13:53:37,824 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:37,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:53:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 13:53:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-13 13:53:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 211 states have internal predecessors, (217), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2024-10-13 13:53:37,852 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 45 [2024-10-13 13:53:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:37,852 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2024-10-13 13:53:37,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:53:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2024-10-13 13:53:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 13:53:37,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:37,854 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 13:53:37,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:53:37,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:37,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -280525862, now seen corresponding path program 1 times [2024-10-13 13:53:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244359622] [2024-10-13 13:53:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:53:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244359622] [2024-10-13 13:53:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244359622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:37,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:53:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703244685] [2024-10-13 13:53:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:37,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:53:37,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:53:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:53:37,947 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:37,959 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2024-10-13 13:53:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:53:37,959 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-10-13 13:53:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:37,960 INFO L225 Difference]: With dead ends: 221 [2024-10-13 13:53:37,960 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 13:53:37,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-13 13:53:37,962 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:37,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:53:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 13:53:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 13:53:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.524822695035461) internal successors, (215), 211 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:53:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2024-10-13 13:53:37,973 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 54 [2024-10-13 13:53:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:37,973 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2024-10-13 13:53:37,973 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2024-10-13 13:53:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 13:53:37,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:37,974 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 13:53:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:53:37,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:37,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1964749084, now seen corresponding path program 1 times [2024-10-13 13:53:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088895725] [2024-10-13 13:53:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:53:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871253872] [2024-10-13 13:53:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:38,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:38,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:53:38,003 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-10-13 13:53:38,007 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-10-13 13:53:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:38,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:53:38,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:53:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:38,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:53:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088895725] [2024-10-13 13:53:38,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:53:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871253872] [2024-10-13 13:53:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871253872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:53:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658291212] [2024-10-13 13:53:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:53:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:38,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:53:38,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:53:38,181 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:38,512 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2024-10-13 13:53:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:53:38,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-13 13:53:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:38,514 INFO L225 Difference]: With dead ends: 358 [2024-10-13 13:53:38,514 INFO L226 Difference]: Without dead ends: 304 [2024-10-13 13:53:38,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-10-13 13:53:38,515 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:38,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:53:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-13 13:53:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-13 13:53:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 288 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:53:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 320 transitions. [2024-10-13 13:53:38,528 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 320 transitions. Word has length 59 [2024-10-13 13:53:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:38,529 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 320 transitions. [2024-10-13 13:53:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 320 transitions. [2024-10-13 13:53:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 13:53:38,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:38,531 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-13 13:53:38,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:53:38,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:38,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -69304982, now seen corresponding path program 1 times [2024-10-13 13:53:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753377966] [2024-10-13 13:53:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:53:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:53:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:53:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:38,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753377966] [2024-10-13 13:53:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753377966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:53:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177409814] [2024-10-13 13:53:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:38,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:53:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:53:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:53:38,847 INFO L87 Difference]: Start difference. First operand 298 states and 320 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:43,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:53:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:43,199 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2024-10-13 13:53:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:53:43,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2024-10-13 13:53:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:43,202 INFO L225 Difference]: With dead ends: 299 [2024-10-13 13:53:43,202 INFO L226 Difference]: Without dead ends: 298 [2024-10-13 13:53:43,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-13 13:53:43,203 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:43,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 298 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 13:53:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-13 13:53:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-13 13:53:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 288 states have internal predecessors, (305), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:53:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 319 transitions. [2024-10-13 13:53:43,211 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 319 transitions. Word has length 65 [2024-10-13 13:53:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 319 transitions. [2024-10-13 13:53:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 319 transitions. [2024-10-13 13:53:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 13:53:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:43,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 13:53:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:53:43,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1220812152, now seen corresponding path program 1 times [2024-10-13 13:53:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062264523] [2024-10-13 13:53:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:53:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85376926] [2024-10-13 13:53:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:53:43,233 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-10-13 13:53:43,234 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-10-13 13:53:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:43,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:53:43,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:53:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 13:53:43,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:53:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062264523] [2024-10-13 13:53:43,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:53:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85376926] [2024-10-13 13:53:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85376926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:53:43,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:53:43,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:53:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309541833] [2024-10-13 13:53:43,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:53:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:53:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:53:43,409 INFO L87 Difference]: Start difference. First operand 298 states and 319 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:43,449 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2024-10-13 13:53:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:53:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2024-10-13 13:53:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:43,451 INFO L225 Difference]: With dead ends: 298 [2024-10-13 13:53:43,451 INFO L226 Difference]: Without dead ends: 295 [2024-10-13 13:53:43,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:53:43,452 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:43,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:53:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-13 13:53:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-13 13:53:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 285 states have internal predecessors, (300), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:53:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 314 transitions. [2024-10-13 13:53:43,457 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 314 transitions. Word has length 95 [2024-10-13 13:53:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:43,458 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 314 transitions. [2024-10-13 13:53:43,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 314 transitions. [2024-10-13 13:53:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 13:53:43,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:43,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 13:53:43,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:53:43,662 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,SelfDestructingSolverStorable8 [2024-10-13 13:53:43,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:43,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 809529056, now seen corresponding path program 1 times [2024-10-13 13:53:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687770067] [2024-10-13 13:53:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:53:43,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188639440] [2024-10-13 13:53:43,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:53:43,678 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-10-13 13:53:43,681 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-10-13 13:53:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:43,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:53:43,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:53:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:43,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:53:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687770067] [2024-10-13 13:53:44,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:53:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188639440] [2024-10-13 13:53:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188639440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:53:44,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:53:44,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-13 13:53:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125333345] [2024-10-13 13:53:44,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:53:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:53:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:53:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:53:44,054 INFO L87 Difference]: Start difference. First operand 295 states and 314 transitions. Second operand has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:53:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:53:44,642 INFO L93 Difference]: Finished difference Result 367 states and 382 transitions. [2024-10-13 13:53:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:53:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 96 [2024-10-13 13:53:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:53:44,644 INFO L225 Difference]: With dead ends: 367 [2024-10-13 13:53:44,644 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 13:53:44,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:53:44,645 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 284 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 13:53:44,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 13:53:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 13:53:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 333. [2024-10-13 13:53:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 257 states have (on average 1.3968871595330739) internal successors, (359), 323 states have internal predecessors, (359), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:53:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2024-10-13 13:53:44,652 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 96 [2024-10-13 13:53:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:53:44,652 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2024-10-13 13:53:44,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:53:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2024-10-13 13:53:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 13:53:44,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:53:44,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 13:53:44,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 13:53:44,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:44,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:53:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:53:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash -674402934, now seen corresponding path program 1 times [2024-10-13 13:53:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:53:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594378865] [2024-10-13 13:53:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:53:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:53:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93439202] [2024-10-13 13:53:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:53:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:53:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:53:44,897 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-10-13 13:53:44,899 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-10-13 13:53:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:53:44,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:53:44,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:53:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:45,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:53:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:53:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:53:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594378865] [2024-10-13 13:53:53,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:53:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93439202] [2024-10-13 13:53:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93439202] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 13:53:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:53:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-13 13:53:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577589128] [2024-10-13 13:53:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:53:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:53:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:53:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:53:53,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:53:53,161 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:53:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:01,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:03,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:06,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:10,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:14,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:17,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:19,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:23,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:25,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:30,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:34,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:34,509 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-10-13 13:54:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:54:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-10-13 13:54:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:34,511 INFO L225 Difference]: With dead ends: 333 [2024-10-13 13:54:34,511 INFO L226 Difference]: Without dead ends: 331 [2024-10-13 13:54:34,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:54:34,512 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 147 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:34,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 41.3s Time] [2024-10-13 13:54:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-13 13:54:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-13 13:54:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 257 states have (on average 1.3813229571984436) internal successors, (355), 321 states have internal predecessors, (355), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 369 transitions. [2024-10-13 13:54:34,519 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 369 transitions. Word has length 97 [2024-10-13 13:54:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:34,520 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 369 transitions. [2024-10-13 13:54:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 369 transitions. [2024-10-13 13:54:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 13:54:34,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:34,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 13:54:34,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 13:54:34,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:34,722 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:34,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash 568345634, now seen corresponding path program 1 times [2024-10-13 13:54:34,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:34,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941299859] [2024-10-13 13:54:34,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:34,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456928489] [2024-10-13 13:54:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:34,739 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-10-13 13:54:34,740 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-10-13 13:54:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:34,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:54:34,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:34,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:54:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941299859] [2024-10-13 13:54:34,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456928489] [2024-10-13 13:54:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456928489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:54:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062294913] [2024-10-13 13:54:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:54:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:54:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:54:34,919 INFO L87 Difference]: Start difference. First operand 331 states and 369 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:35,315 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2024-10-13 13:54:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:54:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2024-10-13 13:54:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:35,317 INFO L225 Difference]: With dead ends: 331 [2024-10-13 13:54:35,317 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 13:54:35,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:54:35,317 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:35,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:54:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 13:54:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-13 13:54:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 257 states have (on average 1.264591439688716) internal successors, (325), 301 states have internal predecessors, (325), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 339 transitions. [2024-10-13 13:54:35,326 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 339 transitions. Word has length 98 [2024-10-13 13:54:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:35,327 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 339 transitions. [2024-10-13 13:54:35,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 339 transitions. [2024-10-13 13:54:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 13:54:35,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:35,328 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 13:54:35,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 13:54:35,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 13:54:35,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:35,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash 438845580, now seen corresponding path program 1 times [2024-10-13 13:54:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:35,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602938466] [2024-10-13 13:54:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383040992] [2024-10-13 13:54:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:35,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:35,554 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-10-13 13:54:35,557 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-10-13 13:54:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:35,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:54:35,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:35,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-13 13:54:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602938466] [2024-10-13 13:54:35,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:35,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383040992] [2024-10-13 13:54:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383040992] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:54:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 13:54:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462230320] [2024-10-13 13:54:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:54:35,966 INFO L87 Difference]: Start difference. First operand 311 states and 339 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:37,891 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2024-10-13 13:54:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:37,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2024-10-13 13:54:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:37,893 INFO L225 Difference]: With dead ends: 311 [2024-10-13 13:54:37,893 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 13:54:37,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:54:37,893 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:37,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 13:54:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 13:54:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-13 13:54:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 299 states have internal predecessors, (321), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2024-10-13 13:54:37,901 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 99 [2024-10-13 13:54:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:37,901 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2024-10-13 13:54:37,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2024-10-13 13:54:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 13:54:37,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:37,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 13:54:37,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:54:38,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:38,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:38,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -920443063, now seen corresponding path program 1 times [2024-10-13 13:54:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686211086] [2024-10-13 13:54:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:54:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:54:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686211086] [2024-10-13 13:54:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686211086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729882825] [2024-10-13 13:54:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:38,206 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-10-13 13:54:38,207 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-10-13 13:54:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:54:38,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:54:38,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:54:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729882825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:38,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:54:38,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-13 13:54:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800267891] [2024-10-13 13:54:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:54:38,400 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:54:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:38,429 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2024-10-13 13:54:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 107 [2024-10-13 13:54:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:38,430 INFO L225 Difference]: With dead ends: 309 [2024-10-13 13:54:38,430 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 13:54:38,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-10-13 13:54:38,431 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:38,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 346 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:54:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 13:54:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-13 13:54:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 298 states have internal predecessors, (319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 333 transitions. [2024-10-13 13:54:38,438 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 333 transitions. Word has length 107 [2024-10-13 13:54:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 333 transitions. [2024-10-13 13:54:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:54:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 333 transitions. [2024-10-13 13:54:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 13:54:38,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:38,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:38,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:54:38,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:38,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:38,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:38,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1531036241, now seen corresponding path program 1 times [2024-10-13 13:54:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306508745] [2024-10-13 13:54:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:54:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:54:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306508745] [2024-10-13 13:54:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306508745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16823888] [2024-10-13 13:54:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:38,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:38,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:38,716 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-10-13 13:54:38,717 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-10-13 13:54:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:38,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:54:38,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:54:38,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:54:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16823888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:54:38,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:54:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 13:54:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907454178] [2024-10-13 13:54:38,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:54:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:54:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:54:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:54:38,947 INFO L87 Difference]: Start difference. First operand 308 states and 333 transitions. Second operand has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 13:54:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:38,995 INFO L93 Difference]: Finished difference Result 407 states and 420 transitions. [2024-10-13 13:54:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:54:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 108 [2024-10-13 13:54:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:38,997 INFO L225 Difference]: With dead ends: 407 [2024-10-13 13:54:38,997 INFO L226 Difference]: Without dead ends: 406 [2024-10-13 13:54:38,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:54:38,997 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:38,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:54:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-13 13:54:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2024-10-13 13:54:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 353 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:54:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 417 transitions. [2024-10-13 13:54:39,007 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 417 transitions. Word has length 108 [2024-10-13 13:54:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:39,007 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 417 transitions. [2024-10-13 13:54:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 13:54:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 417 transitions. [2024-10-13 13:54:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 13:54:39,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:39,008 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:39,020 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-10-13 13:54:39,208 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,SelfDestructingSolverStorable14 [2024-10-13 13:54:39,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:39,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -423331491, now seen corresponding path program 1 times [2024-10-13 13:54:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493615176] [2024-10-13 13:54:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:54:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 13:54:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493615176] [2024-10-13 13:54:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493615176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:39,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:39,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143719941] [2024-10-13 13:54:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:39,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:39,258 INFO L87 Difference]: Start difference. First operand 365 states and 417 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:54:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:39,436 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2024-10-13 13:54:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:54:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-10-13 13:54:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:39,438 INFO L225 Difference]: With dead ends: 365 [2024-10-13 13:54:39,438 INFO L226 Difference]: Without dead ends: 358 [2024-10-13 13:54:39,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-13 13:54:39,438 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:39,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:54:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-13 13:54:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-13 13:54:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.233974358974359) internal successors, (385), 346 states have internal predecessors, (385), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:54:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-10-13 13:54:39,448 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 120 [2024-10-13 13:54:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-10-13 13:54:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:54:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-10-13 13:54:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 13:54:39,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:39,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:39,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 13:54:39,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -238374285, now seen corresponding path program 1 times [2024-10-13 13:54:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330803591] [2024-10-13 13:54:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:54:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:54:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330803591] [2024-10-13 13:54:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330803591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370501056] [2024-10-13 13:54:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:39,498 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:54:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:39,612 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2024-10-13 13:54:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-10-13 13:54:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:39,613 INFO L225 Difference]: With dead ends: 358 [2024-10-13 13:54:39,613 INFO L226 Difference]: Without dead ends: 357 [2024-10-13 13:54:39,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-13 13:54:39,614 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:39,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:54:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-13 13:54:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-13 13:54:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 345 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:54:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 400 transitions. [2024-10-13 13:54:39,623 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 400 transitions. Word has length 121 [2024-10-13 13:54:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 400 transitions. [2024-10-13 13:54:39,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:54:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 400 transitions. [2024-10-13 13:54:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 13:54:39,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:39,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:39,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 13:54:39,624 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419595, now seen corresponding path program 1 times [2024-10-13 13:54:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357072039] [2024-10-13 13:54:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:54:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:54:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357072039] [2024-10-13 13:54:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357072039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55236212] [2024-10-13 13:54:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:39,796 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-10-13 13:54:39,797 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-10-13 13:54:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:39,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 13:54:39,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:54:40,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:54:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55236212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:54:40,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:54:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 13:54:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072521074] [2024-10-13 13:54:40,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:54:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:54:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:54:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:54:40,280 INFO L87 Difference]: Start difference. First operand 357 states and 400 transitions. Second operand has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-13 13:54:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:40,332 INFO L93 Difference]: Finished difference Result 365 states and 405 transitions. [2024-10-13 13:54:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:54:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 123 [2024-10-13 13:54:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:40,334 INFO L225 Difference]: With dead ends: 365 [2024-10-13 13:54:40,334 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 13:54:40,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:54:40,335 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 73 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:40,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 431 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:54:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 13:54:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2024-10-13 13:54:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.0078125) internal successors, (129), 129 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2024-10-13 13:54:40,340 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 123 [2024-10-13 13:54:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2024-10-13 13:54:40,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-13 13:54:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2024-10-13 13:54:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 13:54:40,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:40,342 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:40,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 13:54:40,545 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,SelfDestructingSolverStorable17 [2024-10-13 13:54:40,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:40,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -351277160, now seen corresponding path program 1 times [2024-10-13 13:54:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974992016] [2024-10-13 13:54:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:40,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603004673] [2024-10-13 13:54:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:40,580 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-10-13 13:54:40,581 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-10-13 13:54:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:40,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:54:40,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:54:41,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974992016] [2024-10-13 13:54:45,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603004673] [2024-10-13 13:54:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603004673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:45,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:54:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 13:54:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080532130] [2024-10-13 13:54:45,920 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 13:54:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:54:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:54:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2024-10-13 13:54:45,921 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:54:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:46,140 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2024-10-13 13:54:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:54:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2024-10-13 13:54:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:46,141 INFO L225 Difference]: With dead ends: 137 [2024-10-13 13:54:46,141 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 13:54:46,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2024-10-13 13:54:46,142 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:46,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 161 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:54:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 13:54:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 13:54:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.0) internal successors, (128), 128 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2024-10-13 13:54:46,149 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 146 [2024-10-13 13:54:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:46,150 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2024-10-13 13:54:46,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:54:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2024-10-13 13:54:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 13:54:46,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:46,152 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:46,165 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-10-13 13:54:46,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:46,353 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1995310146, now seen corresponding path program 1 times [2024-10-13 13:54:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808759629] [2024-10-13 13:54:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51244120] [2024-10-13 13:54:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:46,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:46,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:46,370 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-10-13 13:54:46,371 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-10-13 13:54:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:46,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:54:46,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:54:46,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808759629] [2024-10-13 13:54:48,765 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51244120] [2024-10-13 13:54:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51244120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:48,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:54:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 13:54:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983791681] [2024-10-13 13:54:48,766 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 13:54:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:54:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:54:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:54:48,767 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:54:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:48,941 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2024-10-13 13:54:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:54:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2024-10-13 13:54:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:48,941 INFO L225 Difference]: With dead ends: 136 [2024-10-13 13:54:48,942 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:54:48,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:54:48,942 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:48,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 189 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:54:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:54:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:54:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10-13 13:54:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:54:48,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2024-10-13 13:54:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:54:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:54:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:54:48,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2024-10-13 13:54:48,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2024-10-13 13:54:48,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2024-10-13 13:54:48,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2024-10-13 13:54:48,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2024-10-13 13:54:48,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2024-10-13 13:54:48,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2024-10-13 13:54:48,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2024-10-13 13:54:48,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2024-10-13 13:54:48,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2024-10-13 13:54:48,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 13:54:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:49,161 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:49,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:54:49,216 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:54:49,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:54:49 BoogieIcfgContainer [2024-10-13 13:54:49,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:54:49,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:54:49,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:54:49,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:54:49,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:53:36" (3/4) ... [2024-10-13 13:54:49,231 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:54:49,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 13:54:49,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:54:49,237 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 13:54:49,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 13:54:49,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:54:49,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:54:49,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:54:49,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:54:49,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:54:49,308 INFO L158 Benchmark]: Toolchain (without parser) took 73978.70ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 116.3MB in the beginning and 189.6MB in the end (delta: -73.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,308 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 184.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:54:49,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.95ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 103.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,308 INFO L158 Benchmark]: Boogie Preprocessor took 27.88ms. Allocated memory is still 184.5MB. Free memory was 101.4MB in the beginning and 99.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,309 INFO L158 Benchmark]: RCFGBuilder took 543.32ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 131.4MB in the end (delta: -31.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,309 INFO L158 Benchmark]: TraceAbstraction took 73054.66ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 130.4MB in the beginning and 195.9MB in the end (delta: -65.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,309 INFO L158 Benchmark]: Witness Printer took 78.55ms. Allocated memory is still 274.7MB. Free memory was 195.9MB in the beginning and 189.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:54:49,310 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.89ms. Allocated memory is still 184.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.95ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 103.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.88ms. Allocated memory is still 184.5MB. Free memory was 101.4MB in the beginning and 99.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.32ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 131.4MB in the end (delta: -31.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 73054.66ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 130.4MB in the beginning and 195.9MB in the end (delta: -65.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 78.55ms. Allocated memory is still 274.7MB. Free memory was 195.9MB in the beginning and 189.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 72.9s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 50.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1642 mSDsluCounter, 4230 SdHoareTripleChecker+Invalid, 49.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2308 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3966 IncrementalHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 1922 mSDtfsCounter, 3966 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1904 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2527 ConstructedInterpolants, 0 QuantifiedInterpolants, 17247 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 582/985 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 - AllSpecificationsHoldResult: All specifications hold 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((k == 1) && (c == 1)) && (x == 1)) && (y == 1)) || (((((0 <= k) && (c == 0)) && (k <= 1)) && (y == 0)) && (x == 0))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:54:49,331 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 Result: TRUE