./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_22_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_22_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 1ebbfabea49166ff511f5596f0eeb9786f1784f74a677262de4fa3a984c5f1d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:57:22,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:57:22,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:57:22,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:57:22,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:57:22,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:57:22,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:57:22,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:57:22,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:57:22,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:57:22,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:57:22,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:57:22,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:57:22,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:57:22,317 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:57:22,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:57:22,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:57:22,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:57:22,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:57:22,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:57:22,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:57:22,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:57:22,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:57:22,321 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:57:22,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:57:22,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:57:22,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:57:22,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:57:22,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:57:22,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:57:22,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:57:22,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:57:22,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:57:22,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:57:22,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:57:22,325 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ebbfabea49166ff511f5596f0eeb9786f1784f74a677262de4fa3a984c5f1d1 [2024-10-13 14:57:22,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:57:22,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:57:22,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:57:22,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:57:22,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:57:22,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_22_good.i [2024-10-13 14:57:23,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:57:24,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:57:24,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_22_good.i [2024-10-13 14:57:24,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdcdc34b6/d62a9da004224bf18543d0b77902e3a3/FLAG89d02b0dd [2024-10-13 14:57:24,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdcdc34b6/d62a9da004224bf18543d0b77902e3a3 [2024-10-13 14:57:24,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:57:24,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:57:24,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:57:24,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:57:24,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:57:24,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:57:24" (1/1) ... [2024-10-13 14:57:24,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eef16c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:24, skipping insertion in model container [2024-10-13 14:57:24,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:57:24" (1/1) ... [2024-10-13 14:57:24,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:57:24,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:57:24,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:57:24,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:57:25,035 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:57:25,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25 WrapperNode [2024-10-13 14:57:25,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:57:25,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:57:25,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:57:25,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:57:25,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,092 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 100 [2024-10-13 14:57:25,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:57:25,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:57:25,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:57:25,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:57:25,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,122 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:57:25,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:57:25,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:57:25,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:57:25,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:57:25,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (1/1) ... [2024-10-13 14:57:25,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:57:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:57:25,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:57:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:57:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 14:57:25,213 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 14:57:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:57:25,213 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:57:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:57:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:57:25,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:57:25,334 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:57:25,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:57:25,436 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-13 14:57:25,436 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:57:25,470 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:57:25,472 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:57:25,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:57:25 BoogieIcfgContainer [2024-10-13 14:57:25,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:57:25,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:57:25,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:57:25,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:57:25,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:57:24" (1/3) ... [2024-10-13 14:57:25,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1af73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:57:25, skipping insertion in model container [2024-10-13 14:57:25,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:57:25" (2/3) ... [2024-10-13 14:57:25,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1af73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:57:25, skipping insertion in model container [2024-10-13 14:57:25,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:57:25" (3/3) ... [2024-10-13 14:57:25,478 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_22_good.i [2024-10-13 14:57:25,489 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:57:25,489 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 14:57:25,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:57:25,532 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;@70404b96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:57:25,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 14:57:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 14:57:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 14:57:25,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:25,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:25,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1073040488, now seen corresponding path program 1 times [2024-10-13 14:57:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097324422] [2024-10-13 14:57:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:57:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097324422] [2024-10-13 14:57:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097324422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:57:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332688541] [2024-10-13 14:57:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:25,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:25,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:25,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:25,828 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:57:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:25,866 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-10-13 14:57:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 14:57:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:25,872 INFO L225 Difference]: With dead ends: 45 [2024-10-13 14:57:25,872 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 14:57:25,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:25,876 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:25,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 14:57:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-13 14:57:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:57:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-10-13 14:57:25,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2024-10-13 14:57:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:25,902 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-10-13 14:57:25,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:57:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-10-13 14:57:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 14:57:25,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:25,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:57:25,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:25,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1095483182, now seen corresponding path program 1 times [2024-10-13 14:57:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:25,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571136512] [2024-10-13 14:57:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:57:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571136512] [2024-10-13 14:57:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571136512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:57:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076835071] [2024-10-13 14:57:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:25,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:25,969 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:57:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:25,991 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-13 14:57:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 14:57:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:25,993 INFO L225 Difference]: With dead ends: 37 [2024-10-13 14:57:25,993 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 14:57:25,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:25,994 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:25,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 14:57:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 14:57:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 14:57:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-13 14:57:26,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2024-10-13 14:57:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,005 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-13 14:57:26,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:57:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-13 14:57:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 14:57:26,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:26,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 14:57:26,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:26,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1562472497, now seen corresponding path program 1 times [2024-10-13 14:57:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:26,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919420107] [2024-10-13 14:57:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 14:57:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 14:57:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919420107] [2024-10-13 14:57:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919420107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:57:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025021128] [2024-10-13 14:57:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:26,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:26,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,066 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 14:57:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:26,082 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-10-13 14:57:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-13 14:57:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:26,083 INFO L225 Difference]: With dead ends: 59 [2024-10-13 14:57:26,083 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 14:57:26,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,084 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:26,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 14:57:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 14:57:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 14:57:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-13 14:57:26,091 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2024-10-13 14:57:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,092 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-13 14:57:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 14:57:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-13 14:57:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 14:57:26,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:26,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:57:26,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:26,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -467098996, now seen corresponding path program 1 times [2024-10-13 14:57:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534867261] [2024-10-13 14:57:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 14:57:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 14:57:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534867261] [2024-10-13 14:57:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534867261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:57:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326688477] [2024-10-13 14:57:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,164 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 14:57:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:26,182 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-13 14:57:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-13 14:57:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:26,183 INFO L225 Difference]: With dead ends: 35 [2024-10-13 14:57:26,183 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 14:57:26,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,184 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:26,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 14:57:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-13 14:57:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 14:57:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-13 14:57:26,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 19 [2024-10-13 14:57:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,190 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-13 14:57:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 14:57:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-13 14:57:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 14:57:26,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:26,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 14:57:26,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:26,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1595166910, now seen corresponding path program 1 times [2024-10-13 14:57:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:26,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196631817] [2024-10-13 14:57:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 14:57:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 14:57:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196631817] [2024-10-13 14:57:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196631817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:26,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:57:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689921710] [2024-10-13 14:57:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:26,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,224 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 14:57:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:26,238 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-13 14:57:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-13 14:57:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:26,240 INFO L225 Difference]: With dead ends: 33 [2024-10-13 14:57:26,240 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 14:57:26,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,242 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:26,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 14:57:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 14:57:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 14:57:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-13 14:57:26,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2024-10-13 14:57:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-13 14:57:26,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 14:57:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-13 14:57:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 14:57:26,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:26,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 14:57:26,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1594631057, now seen corresponding path program 1 times [2024-10-13 14:57:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329630445] [2024-10-13 14:57:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 14:57:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 14:57:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329630445] [2024-10-13 14:57:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329630445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:26,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 14:57:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812544260] [2024-10-13 14:57:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:57:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:57:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:57:26,348 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 14:57:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:26,370 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-10-13 14:57:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:57:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-13 14:57:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:26,371 INFO L225 Difference]: With dead ends: 44 [2024-10-13 14:57:26,371 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 14:57:26,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:57:26,372 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:26,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 14:57:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 14:57:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 14:57:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-13 14:57:26,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 20 [2024-10-13 14:57:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,385 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-13 14:57:26,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 14:57:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-13 14:57:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 14:57:26,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:57:26,386 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 14:57:26,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:57:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:57:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1395758052, now seen corresponding path program 1 times [2024-10-13 14:57:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:57:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287026592] [2024-10-13 14:57:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:57:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:57:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:57:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 14:57:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 14:57:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:57:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 14:57:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:57:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287026592] [2024-10-13 14:57:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287026592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:57:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:57:26,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:57:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131690786] [2024-10-13 14:57:26,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:57:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:57:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:57:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:57:26,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,438 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:57:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:57:26,450 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-13 14:57:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:57:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-13 14:57:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:57:26,451 INFO L225 Difference]: With dead ends: 38 [2024-10-13 14:57:26,451 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 14:57:26,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:57:26,452 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:57:26,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:57:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 14:57:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 14:57:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 14:57:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 14:57:26,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-10-13 14:57:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:57:26,453 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 14:57:26,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:57:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 14:57:26,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 14:57:26,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 14:57:26,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 14:57:26,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 14:57:26,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 14:57:26,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 14:57:26,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 14:57:26,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 14:57:26,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:57:26,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 14:57:26,508 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:57:26,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:57:26 BoogieIcfgContainer [2024-10-13 14:57:26,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:57:26,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:57:26,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:57:26,519 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:57:26,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:57:25" (3/4) ... [2024-10-13 14:57:26,521 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 14:57:26,523 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 14:57:26,523 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 14:57:26,526 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-13 14:57:26,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-13 14:57:26,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 14:57:26,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 14:57:26,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 14:57:26,599 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 14:57:26,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:57:26,600 INFO L158 Benchmark]: Toolchain (without parser) took 2305.38ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 106.0MB in the end (delta: 39.8MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,600 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:57:26,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.08ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 77.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.87ms. Allocated memory is still 180.4MB. Free memory was 77.7MB in the beginning and 74.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,601 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 180.4MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,601 INFO L158 Benchmark]: RCFGBuilder took 333.19ms. Allocated memory is still 180.4MB. Free memory was 72.4MB in the beginning and 134.5MB in the end (delta: -62.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,601 INFO L158 Benchmark]: TraceAbstraction took 1044.88ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 111.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,601 INFO L158 Benchmark]: Witness Printer took 80.82ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 106.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 14:57:26,602 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.08ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 77.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.87ms. Allocated memory is still 180.4MB. Free memory was 77.7MB in the beginning and 74.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 180.4MB. Free memory was 74.5MB in the beginning and 72.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.19ms. Allocated memory is still 180.4MB. Free memory was 72.4MB in the beginning and 134.5MB in the end (delta: -62.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1044.88ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 111.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Witness Printer took 80.82ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 106.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 244 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 28/28 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 14:57:26,627 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