./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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/recursive-simple/sum_20x0-1.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 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:12:49,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:12:49,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:12:49,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:12:49,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:12:49,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:12:49,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:12:49,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:12:49,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:12:49,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:12:49,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:12:49,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:12:49,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:12:49,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:12:49,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:12:49,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:12:49,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:12:49,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:12:49,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:12:49,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:12:49,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:12:49,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:12:49,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:12:49,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:12:49,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:12:49,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:12:49,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:12:49,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:12:49,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:12:49,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:12:49,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:12:49,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:12:49,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:12:49,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:12:49,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:12:49,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:12:49,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:12:49,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:12:49,944 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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2024-10-14 21:12:50,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:12:50,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:12:50,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:12:50,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:12:50,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:12:50,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2024-10-14 21:12:51,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:12:51,590 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:12:51,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2024-10-14 21:12:51,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a374f3d/9fa4029321434e7db9ddd6f103e339e1/FLAG30d1b5cb7 [2024-10-14 21:12:52,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a374f3d/9fa4029321434e7db9ddd6f103e339e1 [2024-10-14 21:12:52,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:12:52,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:12:52,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:12:52,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:12:52,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:12:52,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd63015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52, skipping insertion in model container [2024-10-14 21:12:52,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:12:52,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:12:52,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:12:52,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:12:52,230 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:12:52,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52 WrapperNode [2024-10-14 21:12:52,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:12:52,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:12:52,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:12:52,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:12:52,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,250 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-14 21:12:52,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:12:52,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:12:52,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:12:52,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:12:52,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,273 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-14 21:12:52,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:12:52,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:12:52,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:12:52,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:12:52,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (1/1) ... [2024-10-14 21:12:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:12:52,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:52,309 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-14 21:12:52,314 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-14 21:12:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:12:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:12:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:12:52,347 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-14 21:12:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-14 21:12:52,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:12:52,407 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:12:52,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:12:52,517 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 21:12:52,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:12:52,534 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:12:52,534 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:12:52,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:52 BoogieIcfgContainer [2024-10-14 21:12:52,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:12:52,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:12:52,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:12:52,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:12:52,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:12:52" (1/3) ... [2024-10-14 21:12:52,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee83bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:12:52, skipping insertion in model container [2024-10-14 21:12:52,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:52" (2/3) ... [2024-10-14 21:12:52,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee83bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:12:52, skipping insertion in model container [2024-10-14 21:12:52,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:52" (3/3) ... [2024-10-14 21:12:52,541 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2024-10-14 21:12:52,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:12:52,553 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 21:12:52,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:12:52,608 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;@36fbc322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:12:52,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 21:12:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:12:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:12:52,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:52,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:12:52,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 71429977, now seen corresponding path program 1 times [2024-10-14 21:12:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:52,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161968945] [2024-10-14 21:12:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:52,841 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-14 21:12:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161968945] [2024-10-14 21:12:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161968945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:12:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667061998] [2024-10-14 21:12:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:52,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:12:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:12:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:12:52,869 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:52,979 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-14 21:12:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:12:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:12:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:52,987 INFO L225 Difference]: With dead ends: 56 [2024-10-14 21:12:52,987 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 21:12:52,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-14 21:12:52,995 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:52,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 21:12:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-14 21:12:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:12:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-14 21:12:53,027 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-14 21:12:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:53,028 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-14 21:12:53,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-14 21:12:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 21:12:53,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:53,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 21:12:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:12:53,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2080632986, now seen corresponding path program 1 times [2024-10-14 21:12:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127456069] [2024-10-14 21:12:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:53,094 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-14 21:12:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127456069] [2024-10-14 21:12:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127456069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:53,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:53,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:12:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885572975] [2024-10-14 21:12:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:53,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:12:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:53,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:12:53,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:12:53,098 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:53,162 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-14 21:12:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:12:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 21:12:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:53,164 INFO L225 Difference]: With dead ends: 37 [2024-10-14 21:12:53,164 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 21:12:53,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-14 21:12:53,165 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:53,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 21:12:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-14 21:12:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:12:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-14 21:12:53,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-10-14 21:12:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:53,185 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-14 21:12:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-14 21:12:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 21:12:53,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:53,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:12:53,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash -75113061, now seen corresponding path program 1 times [2024-10-14 21:12:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885349201] [2024-10-14 21:12:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:53,279 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-14 21:12:53,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:53,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885349201] [2024-10-14 21:12:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885349201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:12:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10974481] [2024-10-14 21:12:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:12:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:12:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:12:53,283 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:53,332 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-14 21:12:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:12:53,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 21:12:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:53,333 INFO L225 Difference]: With dead ends: 36 [2024-10-14 21:12:53,334 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 21:12:53,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-14 21:12:53,336 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 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-14 21:12:53,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 21:12:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 21:12:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:12:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-14 21:12:53,347 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-10-14 21:12:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:53,347 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-14 21:12:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-14 21:12:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 21:12:53,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:53,349 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:53,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:12:53,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:53,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1695709356, now seen corresponding path program 1 times [2024-10-14 21:12:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177154540] [2024-10-14 21:12:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177154540] [2024-10-14 21:12:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177154540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089284035] [2024-10-14 21:12:53,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:53,458 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-14 21:12:53,461 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-14 21:12:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:53,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:12:53,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:53,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089284035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:53,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-14 21:12:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731169634] [2024-10-14 21:12:53,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:53,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:12:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:12:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:12:53,614 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:53,710 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-14 21:12:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:12:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 21:12:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:53,711 INFO L225 Difference]: With dead ends: 87 [2024-10-14 21:12:53,711 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:12:53,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:12:53,712 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:53,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 109 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:12:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2024-10-14 21:12:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 51 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:12:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-14 21:12:53,719 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 12 [2024-10-14 21:12:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:53,719 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-14 21:12:53,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-14 21:12:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:12:53,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:53,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:53,734 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-14 21:12:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:53,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1783930154, now seen corresponding path program 1 times [2024-10-14 21:12:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412462993] [2024-10-14 21:12:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:53,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412462993] [2024-10-14 21:12:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412462993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088279691] [2024-10-14 21:12:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:53,986 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-14 21:12:53,987 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-14 21:12:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:54,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:12:54,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:54,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:12:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088279691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:12:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 21:12:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554400751] [2024-10-14 21:12:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:12:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:12:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:12:54,053 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:54,086 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-10-14 21:12:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:12:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 21:12:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:54,088 INFO L225 Difference]: With dead ends: 65 [2024-10-14 21:12:54,088 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 21:12:54,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:12:54,089 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:54,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 21:12:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-14 21:12:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:12:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-14 21:12:54,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2024-10-14 21:12:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-14 21:12:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-14 21:12:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 21:12:54,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:54,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:12:54,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:12:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:54,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:54,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 532740141, now seen corresponding path program 1 times [2024-10-14 21:12:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586802335] [2024-10-14 21:12:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586802335] [2024-10-14 21:12:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586802335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:54,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029889270] [2024-10-14 21:12:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:54,363 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-14 21:12:54,368 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-14 21:12:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:54,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:12:54,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:54,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029889270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:54,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:54,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-14 21:12:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395657233] [2024-10-14 21:12:54,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:12:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:12:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:12:54,488 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:54,583 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-10-14 21:12:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:12:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 21:12:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:54,585 INFO L225 Difference]: With dead ends: 65 [2024-10-14 21:12:54,585 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 21:12:54,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-14 21:12:54,586 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:54,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 104 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 21:12:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-14 21:12:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.108695652173913) internal successors, (51), 50 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:12:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2024-10-14 21:12:54,594 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2024-10-14 21:12:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2024-10-14 21:12:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2024-10-14 21:12:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 21:12:54,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:54,596 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-14 21:12:54,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:54,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:54,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash 381703833, now seen corresponding path program 2 times [2024-10-14 21:12:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627365195] [2024-10-14 21:12:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627365195] [2024-10-14 21:12:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627365195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531763385] [2024-10-14 21:12:54,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:12:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:54,953 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-14 21:12:54,957 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-14 21:12:54,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:12:54,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:54,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:12:54,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:55,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531763385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:55,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-14 21:12:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632885169] [2024-10-14 21:12:55,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:55,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 21:12:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 21:12:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:12:55,228 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:55,452 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-10-14 21:12:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:12:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 21:12:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:55,453 INFO L225 Difference]: With dead ends: 154 [2024-10-14 21:12:55,453 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 21:12:55,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 21:12:55,455 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 182 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:55,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 229 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 21:12:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-10-14 21:12:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 98 states have internal predecessors, (105), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 21:12:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2024-10-14 21:12:55,471 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 33 [2024-10-14 21:12:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:55,471 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2024-10-14 21:12:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2024-10-14 21:12:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 21:12:55,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:55,474 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-10-14 21:12:55,486 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-14 21:12:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:55,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681720, now seen corresponding path program 2 times [2024-10-14 21:12:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995807235] [2024-10-14 21:12:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:55,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:55,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995807235] [2024-10-14 21:12:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995807235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:55,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447790553] [2024-10-14 21:12:55,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:12:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:55,864 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-14 21:12:55,866 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-14 21:12:55,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:12:55,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:55,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:12:55,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:56,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:56,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447790553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:56,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-14 21:12:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720471310] [2024-10-14 21:12:56,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:12:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:12:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:12:56,258 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:56,540 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-10-14 21:12:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:12:56,541 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-14 21:12:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:56,542 INFO L225 Difference]: With dead ends: 125 [2024-10-14 21:12:56,542 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 21:12:56,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 21:12:56,543 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 216 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:56,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 303 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 21:12:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-10-14 21:12:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.053191489361702) internal successors, (99), 98 states have internal predecessors, (99), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 21:12:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2024-10-14 21:12:56,552 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 36 [2024-10-14 21:12:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2024-10-14 21:12:56,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2024-10-14 21:12:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 21:12:56,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:56,554 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-10-14 21:12:56,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:56,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:56,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:56,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1050877305, now seen corresponding path program 3 times [2024-10-14 21:12:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:56,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739419884] [2024-10-14 21:12:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739419884] [2024-10-14 21:12:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739419884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453590890] [2024-10-14 21:12:57,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:12:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:57,204 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-14 21:12:57,207 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-14 21:12:57,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 21:12:57,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:57,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:12:57,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 21:12:57,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:12:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453590890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:12:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 29 [2024-10-14 21:12:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579760949] [2024-10-14 21:12:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:57,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:12:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:12:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-10-14 21:12:57,322 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:57,407 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2024-10-14 21:12:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:12:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 21:12:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:57,408 INFO L225 Difference]: With dead ends: 124 [2024-10-14 21:12:57,408 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 21:12:57,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-10-14 21:12:57,409 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:57,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 21:12:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-10-14 21:12:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 97 states have internal predecessors, (98), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 21:12:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2024-10-14 21:12:57,422 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 75 [2024-10-14 21:12:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:57,422 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2024-10-14 21:12:57,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2024-10-14 21:12:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 21:12:57,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:57,426 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-14 21:12:57,455 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-14 21:12:57,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:57,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:12:57,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1782541855, now seen corresponding path program 1 times [2024-10-14 21:12:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669433180] [2024-10-14 21:12:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669433180] [2024-10-14 21:12:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669433180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12254302] [2024-10-14 21:12:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:57,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:57,942 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-14 21:12:57,943 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-14 21:12:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:57,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 21:12:57,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:58,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12254302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:59,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2024-10-14 21:12:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198944662] [2024-10-14 21:12:59,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-14 21:12:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-14 21:12:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3932, Unknown=0, NotChecked=0, Total=4556 [2024-10-14 21:12:59,086 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:00,157 INFO L93 Difference]: Finished difference Result 273 states and 294 transitions. [2024-10-14 21:13:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-14 21:13:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 21:13:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:00,159 INFO L225 Difference]: With dead ends: 273 [2024-10-14 21:13:00,159 INFO L226 Difference]: Without dead ends: 231 [2024-10-14 21:13:00,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1785, Invalid=8115, Unknown=0, NotChecked=0, Total=9900 [2024-10-14 21:13:00,161 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 645 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:00,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 868 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-14 21:13:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2024-10-14 21:13:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 174 states have (on average 1.0689655172413792) internal successors, (186), 176 states have internal predecessors, (186), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 21:13:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 230 transitions. [2024-10-14 21:13:00,173 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 230 transitions. Word has length 76 [2024-10-14 21:13:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:00,173 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 230 transitions. [2024-10-14 21:13:00,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 230 transitions. [2024-10-14 21:13:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 21:13:00,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:00,175 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1] [2024-10-14 21:13:00,187 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-14 21:13:00,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:00,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:00,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1234632269, now seen corresponding path program 3 times [2024-10-14 21:13:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138357906] [2024-10-14 21:13:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138357906] [2024-10-14 21:13:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138357906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231385279] [2024-10-14 21:13:00,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:13:00,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:00,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:00,755 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-14 21:13:00,757 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-14 21:13:00,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-14 21:13:00,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:00,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 21:13:00,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:00,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231385279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:01,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2024-10-14 21:13:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061992531] [2024-10-14 21:13:01,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:01,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-14 21:13:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-14 21:13:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:13:01,478 INFO L87 Difference]: Start difference. First operand 220 states and 230 transitions. Second operand has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:02,147 INFO L93 Difference]: Finished difference Result 283 states and 301 transitions. [2024-10-14 21:13:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-14 21:13:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-14 21:13:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:02,150 INFO L225 Difference]: With dead ends: 283 [2024-10-14 21:13:02,150 INFO L226 Difference]: Without dead ends: 282 [2024-10-14 21:13:02,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2024-10-14 21:13:02,152 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:02,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 662 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-14 21:13:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2024-10-14 21:13:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 214 states have (on average 1.0514018691588785) internal successors, (225), 216 states have internal predecessors, (225), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 21:13:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 277 transitions. [2024-10-14 21:13:02,171 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 277 transitions. Word has length 85 [2024-10-14 21:13:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:02,172 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 277 transitions. [2024-10-14 21:13:02,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 277 transitions. [2024-10-14 21:13:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 21:13:02,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:02,175 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2024-10-14 21:13:02,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:02,379 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,SelfDestructingSolverStorable10 [2024-10-14 21:13:02,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:02,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1511407553, now seen corresponding path program 2 times [2024-10-14 21:13:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66076951] [2024-10-14 21:13:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:03,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66076951] [2024-10-14 21:13:03,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66076951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633305369] [2024-10-14 21:13:03,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:03,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:03,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:13:03,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:03,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:03,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 21:13:03,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:03,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633305369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:04,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 92 [2024-10-14 21:13:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233174862] [2024-10-14 21:13:04,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-14 21:13:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-14 21:13:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=6723, Unknown=0, NotChecked=0, Total=8742 [2024-10-14 21:13:04,768 INFO L87 Difference]: Start difference. First operand 268 states and 277 transitions. Second operand has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:06,979 INFO L93 Difference]: Finished difference Result 517 states and 577 transitions. [2024-10-14 21:13:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-10-14 21:13:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-10-14 21:13:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:06,984 INFO L225 Difference]: With dead ends: 517 [2024-10-14 21:13:06,987 INFO L226 Difference]: Without dead ends: 515 [2024-10-14 21:13:06,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5898, Invalid=19224, Unknown=0, NotChecked=0, Total=25122 [2024-10-14 21:13:06,995 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1587 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:06,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 844 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:13:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-14 21:13:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 471. [2024-10-14 21:13:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 384 states have (on average 1.0598958333333333) internal successors, (407), 385 states have internal predecessors, (407), 43 states have call successors, (43), 42 states have call predecessors, (43), 42 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 21:13:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 493 transitions. [2024-10-14 21:13:07,020 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 493 transitions. Word has length 146 [2024-10-14 21:13:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 493 transitions. [2024-10-14 21:13:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 493 transitions. [2024-10-14 21:13:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 21:13:07,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:07,026 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:07,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:07,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash -756686655, now seen corresponding path program 1 times [2024-10-14 21:13:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269102321] [2024-10-14 21:13:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:13:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2024-10-14 21:13:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269102321] [2024-10-14 21:13:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269102321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:13:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414851717] [2024-10-14 21:13:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:13:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:13:07,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:13:07,608 INFO L87 Difference]: Start difference. First operand 471 states and 493 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:07,626 INFO L93 Difference]: Finished difference Result 471 states and 493 transitions. [2024-10-14 21:13:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:13:07,627 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 211 [2024-10-14 21:13:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:07,628 INFO L225 Difference]: With dead ends: 471 [2024-10-14 21:13:07,628 INFO L226 Difference]: Without dead ends: 297 [2024-10-14 21:13:07,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-14 21:13:07,629 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 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-14 21:13:07,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-14 21:13:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2024-10-14 21:13:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 253 states have (on average 1.0039525691699605) internal successors, (254), 253 states have internal predecessors, (254), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2024-10-14 21:13:07,639 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 211 [2024-10-14 21:13:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2024-10-14 21:13:07,639 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2024-10-14 21:13:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-14 21:13:07,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:07,641 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 1, 1, 1] [2024-10-14 21:13:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 21:13:07,642 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2069659821, now seen corresponding path program 4 times [2024-10-14 21:13:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848808089] [2024-10-14 21:13:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 4432 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-10-14 21:13:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848808089] [2024-10-14 21:13:08,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848808089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:08,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:08,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-10-14 21:13:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045001648] [2024-10-14 21:13:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:08,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-14 21:13:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-14 21:13:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 21:13:08,739 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:09,200 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2024-10-14 21:13:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 21:13:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2024-10-14 21:13:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:09,201 INFO L225 Difference]: With dead ends: 296 [2024-10-14 21:13:09,201 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:13:09,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1221, Invalid=3069, Unknown=0, NotChecked=0, Total=4290 [2024-10-14 21:13:09,202 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:09,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 335 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:13:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:13:09,203 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-14 21:13:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:13:09,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2024-10-14 21:13:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:09,204 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:13:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:13:09,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:13:09,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 21:13:09,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 21:13:09,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 21:13:09,210 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2024-10-14 21:13:09,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:13:16,349 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:13:16,574 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 21:13:16,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:13:16 BoogieIcfgContainer [2024-10-14 21:13:16,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:13:16,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:13:16,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:13:16,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:13:16,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:52" (3/4) ... [2024-10-14 21:13:16,587 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:13:16,594 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-10-14 21:13:16,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:13:16,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 21:13:16,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:13:16,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:13:16,689 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:13:16,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:13:16,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:13:16,691 INFO L158 Benchmark]: Toolchain (without parser) took 24667.96ms. Allocated memory was 136.3MB in the beginning and 627.0MB in the end (delta: 490.7MB). Free memory was 67.4MB in the beginning and 229.6MB in the end (delta: -162.2MB). Peak memory consumption was 331.0MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,692 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 136.3MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:13:16,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.16ms. Allocated memory was 136.3MB in the beginning and 249.6MB in the end (delta: 113.2MB). Free memory was 67.1MB in the beginning and 217.2MB in the end (delta: -150.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.20ms. Allocated memory is still 249.6MB. Free memory was 217.2MB in the beginning and 215.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,693 INFO L158 Benchmark]: Boogie Preprocessor took 25.61ms. Allocated memory is still 249.6MB. Free memory was 215.1MB in the beginning and 214.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,693 INFO L158 Benchmark]: RCFGBuilder took 256.62ms. Allocated memory is still 249.6MB. Free memory was 214.1MB in the beginning and 201.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,697 INFO L158 Benchmark]: TraceAbstraction took 24048.80ms. Allocated memory was 249.6MB in the beginning and 627.0MB in the end (delta: 377.5MB). Free memory was 201.5MB in the beginning and 233.8MB in the end (delta: -32.3MB). Peak memory consumption was 359.9MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,697 INFO L158 Benchmark]: Witness Printer took 105.74ms. Allocated memory is still 627.0MB. Free memory was 233.8MB in the beginning and 229.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:13:16,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 136.3MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.16ms. Allocated memory was 136.3MB in the beginning and 249.6MB in the end (delta: 113.2MB). Free memory was 67.1MB in the beginning and 217.2MB in the end (delta: -150.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.20ms. Allocated memory is still 249.6MB. Free memory was 217.2MB in the beginning and 215.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.61ms. Allocated memory is still 249.6MB. Free memory was 215.1MB in the beginning and 214.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 256.62ms. Allocated memory is still 249.6MB. Free memory was 214.1MB in the beginning and 201.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24048.80ms. Allocated memory was 249.6MB in the beginning and 627.0MB in the end (delta: 377.5MB). Free memory was 201.5MB in the beginning and 233.8MB in the end (delta: -32.3MB). Peak memory consumption was 359.9MB. Max. memory is 16.1GB. * Witness Printer took 105.74ms. Allocated memory is still 627.0MB. Free memory was 233.8MB in the beginning and 229.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: 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, 28 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 14, TraceHistogramMax: 42, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3510 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3493 mSDsluCounter, 3721 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3306 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3756 IncrementalHoareTripleChecker+Invalid, 4163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 415 mSDtfsCounter, 3756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1312 GetRequests, 762 SyntacticMatches, 4 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11311 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=12, InterpolantAutomatonStates: 354, 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, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1445 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1881 ConstructedInterpolants, 0 QuantifiedInterpolants, 4841 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 8306/15486 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 8 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum. Requires: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) Ensures: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:13:16,740 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