./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/hard-ll_unwindbound1.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/hard-ll_unwindbound1.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 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:40:14,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:40:14,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:40:14,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:40:14,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:40:14,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:40:14,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:40:14,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:40:14,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:40:14,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:40:14,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:40:14,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:40:14,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:40:14,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:40:14,385 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:40:14,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:40:14,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:40:14,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:40:14,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:40:14,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:40:14,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:40:14,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:40:14,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:40:14,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:40:14,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:40:14,389 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:40:14,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:40:14,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:40:14,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:40:14,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:40:14,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:40:14,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:40:14,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:40:14,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:40:14,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:40:14,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:40:14,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:40:14,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:40:14,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:40:14,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:40:14,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:40:14,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:40:14,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:40:14,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:40:14,395 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 -> 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 [2024-10-13 13:40:14,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:40:14,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:40:14,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:40:14,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:40:14,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:40:14,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2024-10-13 13:40:16,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:40:16,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:40:16,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2024-10-13 13:40:16,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696168376/28d97998ffc642c5a3755fba90e12bdd/FLAG437034086 [2024-10-13 13:40:16,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696168376/28d97998ffc642c5a3755fba90e12bdd [2024-10-13 13:40:16,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:40:16,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:40:16,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:40:16,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:40:16,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:40:16,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eabc408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16, skipping insertion in model container [2024-10-13 13:40:16,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:40:16,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:40:16,486 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:40:16,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:40:16,534 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:40:16,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16 WrapperNode [2024-10-13 13:40:16,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:40:16,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:40:16,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:40:16,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:40:16,543 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:40:16" (1/1) ... [2024-10-13 13:40:16,550 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:40:16" (1/1) ... [2024-10-13 13:40:16,580 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-10-13 13:40:16,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:40:16,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:40:16,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:40:16,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:40:16,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,608 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:40:16,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:40:16,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:40:16,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:40:16,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:40:16,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (1/1) ... [2024-10-13 13:40:16,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:40:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:16,670 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:40:16,674 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:40:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:40:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:40:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:40:16,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:40:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:40:16,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:40:16,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:40:16,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:40:17,178 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-13 13:40:17,179 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:40:17,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:40:17,205 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:40:17,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:17 BoogieIcfgContainer [2024-10-13 13:40:17,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:40:17,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:40:17,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:40:17,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:40:17,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:40:16" (1/3) ... [2024-10-13 13:40:17,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf085c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:17, skipping insertion in model container [2024-10-13 13:40:17,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:16" (2/3) ... [2024-10-13 13:40:17,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf085c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:17, skipping insertion in model container [2024-10-13 13:40:17,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:17" (3/3) ... [2024-10-13 13:40:17,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.c [2024-10-13 13:40:17,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:40:17,230 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-13 13:40:17,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:40:17,309 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;@266dd817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:40:17,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-13 13:40:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 42 states have (on average 1.880952380952381) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:40:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:40:17,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:17,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:40:17,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 163621270, now seen corresponding path program 1 times [2024-10-13 13:40:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49752269] [2024-10-13 13:40:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:40:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49752269] [2024-10-13 13:40:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49752269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:17,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38351475] [2024-10-13 13:40:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:17,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:40:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:17,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:40:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:40:17,480 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.880952380952381) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:40:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:17,510 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2024-10-13 13:40:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:40:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:40:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:17,521 INFO L225 Difference]: With dead ends: 156 [2024-10-13 13:40:17,521 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 13:40:17,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:40:17,527 INFO L432 NwaCegarLoop]: 87 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, 87 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:40:17,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 13:40:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 13:40:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 68 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:40:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-10-13 13:40:17,567 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 5 [2024-10-13 13:40:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:17,567 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-10-13 13:40:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:40:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-10-13 13:40:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:40:17,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:17,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:40:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:40:17,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 163680852, now seen corresponding path program 1 times [2024-10-13 13:40:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825493095] [2024-10-13 13:40:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:40:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825493095] [2024-10-13 13:40:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825493095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:17,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:17,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507881572] [2024-10-13 13:40:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:17,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:40:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:40:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:40:17,702 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:40:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:17,764 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2024-10-13 13:40:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:40:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:40:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:17,767 INFO L225 Difference]: With dead ends: 131 [2024-10-13 13:40:17,767 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 13:40:17,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:40:17,769 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:17,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 228 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 13:40:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 13:40:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:40:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-13 13:40:17,788 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 5 [2024-10-13 13:40:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:17,788 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-13 13:40:17,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:40:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-13 13:40:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:40:17,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:17,792 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:17,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:40:17,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:17,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1612836388, now seen corresponding path program 1 times [2024-10-13 13:40:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:17,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145802445] [2024-10-13 13:40:17,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:40:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038659629] [2024-10-13 13:40:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:17,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:17,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:17,834 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:40:17,836 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:40:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:17,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:40:17,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:17,977 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:40:17,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:17,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145802445] [2024-10-13 13:40:17,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:40:17,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038659629] [2024-10-13 13:40:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038659629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635628660] [2024-10-13 13:40:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:17,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:40:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:40:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:40:17,986 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:40:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:18,048 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2024-10-13 13:40:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:40:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-13 13:40:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:18,050 INFO L225 Difference]: With dead ends: 172 [2024-10-13 13:40:18,050 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 13:40:18,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:40:18,052 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:18,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 13:40:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2024-10-13 13:40:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 90 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-13 13:40:18,064 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 18 [2024-10-13 13:40:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-13 13:40:18,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:40:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-13 13:40:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 13:40:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:18,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:18,083 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:40:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:18,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1309924490, now seen corresponding path program 1 times [2024-10-13 13:40:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855710641] [2024-10-13 13:40:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855710641] [2024-10-13 13:40:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855710641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127186736] [2024-10-13 13:40:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:40:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:40:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:40:18,419 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:18,519 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-10-13 13:40:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:40:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-13 13:40:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:18,521 INFO L225 Difference]: With dead ends: 102 [2024-10-13 13:40:18,521 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 13:40:18,521 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:40:18,522 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:18,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 13:40:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 13:40:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.619047619047619) internal successors, (102), 88 states have internal predecessors, (102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2024-10-13 13:40:18,534 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 26 [2024-10-13 13:40:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:18,534 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2024-10-13 13:40:18,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2024-10-13 13:40:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:40:18,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:18,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:18,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:40:18,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:18,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1952954963, now seen corresponding path program 1 times [2024-10-13 13:40:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435583231] [2024-10-13 13:40:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435583231] [2024-10-13 13:40:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435583231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:40:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715751931] [2024-10-13 13:40:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:40:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:40:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:40:18,708 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:18,829 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2024-10-13 13:40:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:40:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-13 13:40:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:18,831 INFO L225 Difference]: With dead ends: 136 [2024-10-13 13:40:18,831 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 13:40:18,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:40:18,832 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 31 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:18,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 413 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 13:40:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-10-13 13:40:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 84 states have internal predecessors, (92), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:40:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-13 13:40:18,853 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 27 [2024-10-13 13:40:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:18,853 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-13 13:40:18,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-13 13:40:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:40:18,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:18,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:18,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:40:18,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1952953457, now seen corresponding path program 1 times [2024-10-13 13:40:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105008465] [2024-10-13 13:40:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:18,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105008465] [2024-10-13 13:40:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105008465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:18,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:18,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271877762] [2024-10-13 13:40:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:18,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:40:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:40:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:40:18,966 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:19,013 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-10-13 13:40:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:40:19,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-13 13:40:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:19,014 INFO L225 Difference]: With dead ends: 101 [2024-10-13 13:40:19,014 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 13:40:19,015 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:40:19,015 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:19,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 13:40:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-13 13:40:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 84 states have internal predecessors, (91), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:40:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-10-13 13:40:19,026 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 27 [2024-10-13 13:40:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:19,027 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-10-13 13:40:19,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-10-13 13:40:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 13:40:19,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:19,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:40:19,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash -412061625, now seen corresponding path program 1 times [2024-10-13 13:40:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208919845] [2024-10-13 13:40:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208919845] [2024-10-13 13:40:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208919845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:40:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573993528] [2024-10-13 13:40:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:40:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:40:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:40:19,153 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:19,246 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-13 13:40:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:40:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-13 13:40:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:19,248 INFO L225 Difference]: With dead ends: 101 [2024-10-13 13:40:19,248 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 13:40:19,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:40:19,249 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 411 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 13:40:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-13 13:40:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 84 states have internal predecessors, (90), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:40:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-13 13:40:19,258 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 28 [2024-10-13 13:40:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:19,258 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-13 13:40:19,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-13 13:40:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:40:19,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:19,259 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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:40:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:40:19,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -854227561, now seen corresponding path program 1 times [2024-10-13 13:40:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2725864] [2024-10-13 13:40:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:40:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376254506] [2024-10-13 13:40:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:19,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:19,282 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:40:19,284 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:40:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:40:19,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:19,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2725864] [2024-10-13 13:40:19,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:40:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376254506] [2024-10-13 13:40:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376254506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256196497] [2024-10-13 13:40:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:40:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:40:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:40:19,378 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:19,434 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2024-10-13 13:40:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:40:19,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-13 13:40:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:19,435 INFO L225 Difference]: With dead ends: 134 [2024-10-13 13:40:19,435 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 13:40:19,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:40:19,436 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 43 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:19,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 13:40:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-10-13 13:40:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 102 states have internal predecessors, (120), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2024-10-13 13:40:19,452 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2024-10-13 13:40:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2024-10-13 13:40:19,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2024-10-13 13:40:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 13:40:19,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:19,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:19,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:40:19,657 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,SelfDestructingSolverStorable7 [2024-10-13 13:40:19,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:19,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 679168499, now seen corresponding path program 1 times [2024-10-13 13:40:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176621381] [2024-10-13 13:40:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176621381] [2024-10-13 13:40:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176621381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:40:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661410244] [2024-10-13 13:40:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:19,804 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:40:19,805 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:40:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:19,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:40:19,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:19,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661410244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:40:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:40:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804258557] [2024-10-13 13:40:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:40:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:40:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:40:19,942 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:19,974 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-13 13:40:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:40:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-10-13 13:40:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:19,975 INFO L225 Difference]: With dead ends: 124 [2024-10-13 13:40:19,975 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 13:40:19,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:40:19,976 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 19 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:19,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 13:40:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-13 13:40:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 80 states have (on average 1.525) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-13 13:40:19,988 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 31 [2024-10-13 13:40:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:19,988 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-13 13:40:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-13 13:40:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 13:40:19,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:19,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:20,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:40:20,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:20,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:20,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -573928199, now seen corresponding path program 1 times [2024-10-13 13:40:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411033167] [2024-10-13 13:40:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411033167] [2024-10-13 13:40:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411033167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:40:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111982023] [2024-10-13 13:40:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:40:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:40:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:40:20,273 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:20,577 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2024-10-13 13:40:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:40:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-13 13:40:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:20,578 INFO L225 Difference]: With dead ends: 131 [2024-10-13 13:40:20,578 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 13:40:20,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:40:20,579 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:20,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:40:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 13:40:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2024-10-13 13:40:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 105 states have internal predecessors, (123), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-10-13 13:40:20,596 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 32 [2024-10-13 13:40:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:20,596 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-10-13 13:40:20,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-10-13 13:40:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 13:40:20,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:20,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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:40:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:40:20,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:20,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash -420612963, now seen corresponding path program 1 times [2024-10-13 13:40:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667849712] [2024-10-13 13:40:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:20,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667849712] [2024-10-13 13:40:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667849712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:40:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941336189] [2024-10-13 13:40:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:20,692 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:40:20,694 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:40:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:20,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:40:20,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:20,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941336189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:40:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-13 13:40:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670125179] [2024-10-13 13:40:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:40:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:40:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:40:20,783 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:20,831 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-13 13:40:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:40:20,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-13 13:40:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:20,833 INFO L225 Difference]: With dead ends: 124 [2024-10-13 13:40:20,833 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 13:40:20,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:40:20,835 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:20,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 265 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 13:40:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2024-10-13 13:40:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-13 13:40:20,845 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 32 [2024-10-13 13:40:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-13 13:40:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-13 13:40:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:40:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:20,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:20,863 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:40:21,047 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:40:21,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash -611904844, now seen corresponding path program 1 times [2024-10-13 13:40:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314324597] [2024-10-13 13:40:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:40:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533028187] [2024-10-13 13:40:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:21,063 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:40:21,064 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:40:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:40:21,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:21,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314324597] [2024-10-13 13:40:21,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:40:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533028187] [2024-10-13 13:40:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533028187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:40:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064094172] [2024-10-13 13:40:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:21,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:40:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:40:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:40:21,268 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:21,345 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-10-13 13:40:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:40:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-13 13:40:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:21,347 INFO L225 Difference]: With dead ends: 123 [2024-10-13 13:40:21,347 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 13:40:21,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:40:21,348 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:21,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 13:40:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-13 13:40:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 100 states have internal predecessors, (117), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2024-10-13 13:40:21,357 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 33 [2024-10-13 13:40:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:21,357 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2024-10-13 13:40:21,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2024-10-13 13:40:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 13:40:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:21,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:21,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:40:21,562 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:40:21,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2061126728, now seen corresponding path program 1 times [2024-10-13 13:40:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045533410] [2024-10-13 13:40:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 13:40:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045533410] [2024-10-13 13:40:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045533410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:40:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441620658] [2024-10-13 13:40:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:40:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:21,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:40:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:40:21,636 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:21,681 INFO L93 Difference]: Finished difference Result 194 states and 235 transitions. [2024-10-13 13:40:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:40:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-13 13:40:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:21,684 INFO L225 Difference]: With dead ends: 194 [2024-10-13 13:40:21,684 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 13:40:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:40:21,685 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:21,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 13:40:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-10-13 13:40:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 104 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:40:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-10-13 13:40:21,699 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 35 [2024-10-13 13:40:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:21,699 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-10-13 13:40:21,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-10-13 13:40:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 13:40:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:21,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:21,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 13:40:21,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash 529580956, now seen corresponding path program 1 times [2024-10-13 13:40:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055380339] [2024-10-13 13:40:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055380339] [2024-10-13 13:40:21,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055380339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:40:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482580082] [2024-10-13 13:40:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:21,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:21,827 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:40:21,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:40:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:21,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:40:21,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:21,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:40:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:40:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482580082] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:40:22,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:40:22,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-10-13 13:40:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093969295] [2024-10-13 13:40:22,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:40:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:40:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:22,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:40:22,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:40:22,038 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 13:40:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:22,221 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2024-10-13 13:40:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 13:40:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 36 [2024-10-13 13:40:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:22,222 INFO L225 Difference]: With dead ends: 169 [2024-10-13 13:40:22,222 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 13:40:22,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:40:22,223 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 81 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:22,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 622 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 13:40:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2024-10-13 13:40:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.518181818181818) internal successors, (167), 133 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:40:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 191 transitions. [2024-10-13 13:40:22,237 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 191 transitions. Word has length 36 [2024-10-13 13:40:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:22,237 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 191 transitions. [2024-10-13 13:40:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 13:40:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 191 transitions. [2024-10-13 13:40:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 13:40:22,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:22,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:22,256 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:40:22,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:22,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:22,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash -357659521, now seen corresponding path program 1 times [2024-10-13 13:40:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:22,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303481860] [2024-10-13 13:40:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:40:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704011526] [2024-10-13 13:40:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:22,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:22,458 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:40:22,459 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:40:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:22,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:40:22,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:40:22,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:40:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303481860] [2024-10-13 13:40:22,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:40:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704011526] [2024-10-13 13:40:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704011526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:40:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:40:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:40:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119109282] [2024-10-13 13:40:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:40:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:40:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:40:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:40:22,606 INFO L87 Difference]: Start difference. First operand 150 states and 191 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:22,700 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2024-10-13 13:40:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:40:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-13 13:40:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:22,702 INFO L225 Difference]: With dead ends: 162 [2024-10-13 13:40:22,702 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 13:40:22,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:40:22,703 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:22,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:40:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 13:40:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 143. [2024-10-13 13:40:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 126 states have internal predecessors, (153), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:40:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2024-10-13 13:40:22,711 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 41 [2024-10-13 13:40:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2024-10-13 13:40:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 13:40:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2024-10-13 13:40:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 13:40:22,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:40:22,713 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:22,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 13:40:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:22,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-13 13:40:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:40:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash -911870819, now seen corresponding path program 1 times [2024-10-13 13:40:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:40:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602724089] [2024-10-13 13:40:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:40:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:40:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:40:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:22,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:40:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 13:40:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 13:40:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:40:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:40:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602724089] [2024-10-13 13:40:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602724089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:40:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844582172] [2024-10-13 13:40:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:40:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:40:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:40:23,007 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:40:23,008 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:40:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:40:23,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:40:23,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:40:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:40:23,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:40:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:40:23,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844582172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:40:23,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:40:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2024-10-13 13:40:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173723736] [2024-10-13 13:40:23,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:40:23,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:40:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:40:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:40:23,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:40:23,179 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 13:40:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:40:23,219 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2024-10-13 13:40:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:40:23,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 44 [2024-10-13 13:40:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:40:23,220 INFO L225 Difference]: With dead ends: 147 [2024-10-13 13:40:23,220 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:40:23,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:40:23,221 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:40:23,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:40:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:40:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:40:23,222 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:40:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:40:23,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-10-13 13:40:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:40:23,223 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:40:23,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 13:40:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:40:23,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:40:23,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2024-10-13 13:40:23,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2024-10-13 13:40:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2024-10-13 13:40:23,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2024-10-13 13:40:23,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2024-10-13 13:40:23,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2024-10-13 13:40:23,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2024-10-13 13:40:23,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2024-10-13 13:40:23,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:40:23,429 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,SelfDestructingSolverStorable15 [2024-10-13 13:40:23,432 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:40:23,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:40:23,562 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:40:23,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:40:23 BoogieIcfgContainer [2024-10-13 13:40:23,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:40:23,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:40:23,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:40:23,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:40:23,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:17" (3/4) ... [2024-10-13 13:40:23,591 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:40:23,594 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:40:23,601 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 13:40:23,601 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 13:40:23,602 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:40:23,602 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:40:23,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:40:23,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:40:23,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:40:23,703 INFO L158 Benchmark]: Toolchain (without parser) took 7437.39ms. Allocated memory was 132.1MB in the beginning and 239.1MB in the end (delta: 107.0MB). Free memory was 59.9MB in the beginning and 172.6MB in the end (delta: -112.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:40:23,703 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 94.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:40:23,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.78ms. Allocated memory was 132.1MB in the beginning and 199.2MB in the end (delta: 67.1MB). Free memory was 59.7MB in the beginning and 168.2MB in the end (delta: -108.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.94ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 167.6MB in the end (delta: 536.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,704 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 199.2MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,704 INFO L158 Benchmark]: RCFGBuilder took 582.34ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 146.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,704 INFO L158 Benchmark]: TraceAbstraction took 6380.15ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 146.6MB in the beginning and 177.8MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,704 INFO L158 Benchmark]: Witness Printer took 114.54ms. Allocated memory is still 239.1MB. Free memory was 177.8MB in the beginning and 172.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:40:23,706 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.19ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 94.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.78ms. Allocated memory was 132.1MB in the beginning and 199.2MB in the end (delta: 67.1MB). Free memory was 59.7MB in the beginning and 168.2MB in the end (delta: -108.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.94ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 167.6MB in the end (delta: 536.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 199.2MB. Free memory was 167.6MB in the beginning and 165.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.34ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 146.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6380.15ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 146.6MB in the beginning and 177.8MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 114.54ms. Allocated memory is still 239.1MB. Free memory was 177.8MB in the beginning and 172.6MB in the end (delta: 5.2MB). 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: 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: 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 2 procedures, 79 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 3342 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2264 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1078 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=14, InterpolantAutomatonStates: 82, 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, 16 MinimizatonAttempts, 110 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 651 ConstructedInterpolants, 0 QuantifiedInterpolants, 1711 SizeOfPredicates, 11 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 350/367 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 28 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((0 <= r) && (r <= 4294967295)) && (q == 0)) && (counter == 1)) && (0 <= d)) || (((((((p == 1) && (d <= 4294967295)) && (0 <= r)) && (r <= 4294967295)) && (q == 0)) && (counter == 0)) && (0 <= d))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((0 <= r) && (r <= 4294967295)) && (q == 0)) && (counter == 2)) && (0 <= d)) || ((((((p == 1) && (d <= 4294967295)) && (0 <= r)) && (q == 0)) && (counter == 1)) && (((__int128) r + 1) <= d))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:40:23,733 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