./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_rand_add_06_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_rand_add_06_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 3d39c14fa7a6a46f1ee8cba60d94361985674e2904bfc85b9897d385d0ddea46 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:15:40,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:15:40,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:15:40,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:15:40,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:15:40,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:15:40,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:15:40,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:15:40,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:15:40,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:15:40,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:15:40,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:15:40,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:15:40,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:15:40,114 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:15:40,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:15:40,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:15:40,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:15:40,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:15:40,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:15:40,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:15:40,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:15:40,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:15:40,120 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:15:40,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:15:40,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:15:40,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:15:40,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:15:40,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:15:40,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:15:40,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:15:40,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:15:40,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:15:40,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:15:40,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:15:40,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:15:40,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:15:40,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:15:40,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:15:40,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:15:40,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:15:40,123 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 -> 3d39c14fa7a6a46f1ee8cba60d94361985674e2904bfc85b9897d385d0ddea46 [2024-10-13 15:15:40,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:15:40,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:15:40,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:15:40,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:15:40,364 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:15:40,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_06_good.i [2024-10-13 15:15:41,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:15:41,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:15:41,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_06_good.i [2024-10-13 15:15:41,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467df51cd/38ac27ba65074c71b8a21f624f23906e/FLAG3b2c0f9f1 [2024-10-13 15:15:42,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467df51cd/38ac27ba65074c71b8a21f624f23906e [2024-10-13 15:15:42,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:15:42,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:15:42,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:15:42,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:15:42,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:15:42,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:42,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b1b658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42, skipping insertion in model container [2024-10-13 15:15:42,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:42,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:15:42,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:15:42,813 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:15:42,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:15:42,968 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:15:42,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42 WrapperNode [2024-10-13 15:15:42,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:15:42,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:15:42,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:15:42,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:15:42,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:42,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,019 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2024-10-13 15:15:43,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:15:43,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:15:43,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:15:43,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:15:43,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,043 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:15:43,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:15:43,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:15:43,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:15:43,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:15:43,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (1/1) ... [2024-10-13 15:15:43,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:15:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:15:43,093 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 15:15:43,095 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 15:15:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:15:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:15:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:15:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:15:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:15:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:15:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:15:43,235 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:15:43,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:15:43,482 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-13 15:15:43,482 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:15:43,519 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:15:43,520 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:15:43,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:15:43 BoogieIcfgContainer [2024-10-13 15:15:43,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:15:43,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:15:43,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:15:43,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:15:43,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:15:42" (1/3) ... [2024-10-13 15:15:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4866a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:15:43, skipping insertion in model container [2024-10-13 15:15:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:15:42" (2/3) ... [2024-10-13 15:15:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4866a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:15:43, skipping insertion in model container [2024-10-13 15:15:43,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:15:43" (3/3) ... [2024-10-13 15:15:43,528 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_06_good.i [2024-10-13 15:15:43,543 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:15:43,543 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:15:43,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:15:43,628 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;@118834f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:15:43,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:15:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 15:15:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:15:43,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:43,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:43,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -611380514, now seen corresponding path program 1 times [2024-10-13 15:15:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776254084] [2024-10-13 15:15:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:43,902 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 15:15:43,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776254084] [2024-10-13 15:15:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776254084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:15:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803191079] [2024-10-13 15:15:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:43,943 INFO L87 Difference]: Start difference. First operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.0) 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 15:15:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:43,990 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2024-10-13 15:15:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:43,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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 15:15:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:43,998 INFO L225 Difference]: With dead ends: 174 [2024-10-13 15:15:43,998 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 15:15:44,000 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 15:15:44,003 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 15:15:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 15:15:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 83 states have internal predecessors, (112), 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 15:15:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2024-10-13 15:15:44,033 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 11 [2024-10-13 15:15:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,034 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-10-13 15:15:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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 15:15:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2024-10-13 15:15:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 15:15:44,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:15:44,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 750401249, now seen corresponding path program 1 times [2024-10-13 15:15:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654382591] [2024-10-13 15:15:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,200 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 15:15:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654382591] [2024-10-13 15:15:44,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654382591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910391924] [2024-10-13 15:15:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,205 INFO L87 Difference]: Start difference. First operand 92 states and 124 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, (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 15:15:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,233 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2024-10-13 15:15:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,233 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, (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 17 [2024-10-13 15:15:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,234 INFO L225 Difference]: With dead ends: 92 [2024-10-13 15:15:44,234 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 15:15:44,235 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 15:15:44,235 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 15:15:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 15:15:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 82 states have internal predecessors, (111), 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 15:15:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-10-13 15:15:44,245 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 17 [2024-10-13 15:15:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-10-13 15:15:44,245 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, (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 15:15:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-10-13 15:15:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 15:15:44,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:15:44,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1787602382, now seen corresponding path program 1 times [2024-10-13 15:15:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246322553] [2024-10-13 15:15:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,278 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 15:15:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246322553] [2024-10-13 15:15:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246322553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168758579] [2024-10-13 15:15:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,281 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 15:15:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,296 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-10-13 15:15:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-10-13 15:15:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,297 INFO L225 Difference]: With dead ends: 91 [2024-10-13 15:15:44,297 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 15:15:44,298 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 15:15:44,298 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 15:15:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 15:15:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 81 states have internal predecessors, (110), 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 15:15:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-13 15:15:44,304 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 18 [2024-10-13 15:15:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-13 15:15:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 15:15:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-13 15:15:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 15:15:44,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:15:44,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1281517514, now seen corresponding path program 1 times [2024-10-13 15:15:44,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362238319] [2024-10-13 15:15:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 15:15:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,429 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 15:15:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362238319] [2024-10-13 15:15:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362238319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514929477] [2024-10-13 15:15:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,431 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 15:15:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,447 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-13 15:15:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 33 [2024-10-13 15:15:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,449 INFO L225 Difference]: With dead ends: 90 [2024-10-13 15:15:44,449 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 15:15:44,449 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 15:15:44,450 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 15:15:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 15:15:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 80 states have internal predecessors, (109), 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 15:15:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-13 15:15:44,455 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2024-10-13 15:15:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-13 15:15:44,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 15:15:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-13 15:15:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 15:15:44,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:15:44,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1072337516, now seen corresponding path program 1 times [2024-10-13 15:15:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409316476] [2024-10-13 15:15:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 15:15:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,509 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 15:15:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409316476] [2024-10-13 15:15:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409316476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185243444] [2024-10-13 15:15:44,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,511 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 15:15:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,530 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-13 15:15:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 34 [2024-10-13 15:15:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,531 INFO L225 Difference]: With dead ends: 89 [2024-10-13 15:15:44,532 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 15:15:44,532 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 15:15:44,532 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 15:15:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 15:15:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 79 states have internal predecessors, (108), 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 15:15:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-10-13 15:15:44,538 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2024-10-13 15:15:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-10-13 15:15:44,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 15:15:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-10-13 15:15:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 15:15:44,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 15:15:44,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1700673409, now seen corresponding path program 1 times [2024-10-13 15:15:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379369593] [2024-10-13 15:15:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 15:15:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 15:15:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,590 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 15:15:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379369593] [2024-10-13 15:15:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379369593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992805527] [2024-10-13 15:15:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,595 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 15:15:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,611 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2024-10-13 15:15:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 42 [2024-10-13 15:15:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,614 INFO L225 Difference]: With dead ends: 88 [2024-10-13 15:15:44,614 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 15:15:44,615 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 15:15:44,615 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 15:15:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 15:15:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 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 15:15:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-13 15:15:44,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 42 [2024-10-13 15:15:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,626 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-13 15:15:44,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 15:15:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-13 15:15:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 15:15:44,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:15:44,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 15:15:44,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:15:44,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:15:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1349846130, now seen corresponding path program 1 times [2024-10-13 15:15:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:15:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519932370] [2024-10-13 15:15:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:15:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:15:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:15:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 15:15:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 15:15:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 15:15:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:15:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 15:15:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:15:44,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519932370] [2024-10-13 15:15:44,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519932370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:15:44,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:15:44,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:15:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784149153] [2024-10-13 15:15:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:15:44,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:15:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:15:44,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:15:44,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:15:44,693 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:15:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:15:44,704 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2024-10-13 15:15:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:15:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-10-13 15:15:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:15:44,705 INFO L225 Difference]: With dead ends: 86 [2024-10-13 15:15:44,705 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:15:44,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 15:15:44,706 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:15:44,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:15:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:15:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:15:44,707 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 15:15:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:15:44,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2024-10-13 15:15:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:15:44,707 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:15:44,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:15:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:15:44,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:15:44,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:15:44,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:15:44,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:15:44,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:15:44,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:15:44,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:15:44,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:15:44,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:15:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 15:15:44,716 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:15:44,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:15:44,746 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:15:44,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:15:44 BoogieIcfgContainer [2024-10-13 15:15:44,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:15:44,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:15:44,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:15:44,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:15:44,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:15:43" (3/4) ... [2024-10-13 15:15:44,759 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:15:44,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:15:44,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:15:44,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 15:15:44,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 15:15:44,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 15:15:44,769 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:15:44,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:15:44,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:15:44,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:15:44,852 INFO L158 Benchmark]: Toolchain (without parser) took 2650.29ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 73.8MB in the beginning and 111.9MB in the end (delta: -38.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,852 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:15:44,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.73ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 133.3MB in the end (delta: -59.7MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.91ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 129.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,853 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 211.8MB. Free memory was 129.1MB in the beginning and 126.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,853 INFO L158 Benchmark]: RCFGBuilder took 464.90ms. Allocated memory is still 211.8MB. Free memory was 126.1MB in the beginning and 99.8MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,853 INFO L158 Benchmark]: TraceAbstraction took 1235.10ms. Allocated memory is still 211.8MB. Free memory was 99.8MB in the beginning and 119.2MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:15:44,853 INFO L158 Benchmark]: Witness Printer took 93.65ms. Allocated memory is still 211.8MB. Free memory was 119.2MB in the beginning and 111.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 15:15:44,854 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.16ms. Allocated memory is still 151.0MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.73ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 73.6MB in the beginning and 133.3MB in the end (delta: -59.7MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.91ms. Allocated memory is still 211.8MB. Free memory was 133.3MB in the beginning and 129.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 211.8MB. Free memory was 129.1MB in the beginning and 126.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.90ms. Allocated memory is still 211.8MB. Free memory was 126.1MB in the beginning and 99.8MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1235.10ms. Allocated memory is still 211.8MB. Free memory was 99.8MB in the beginning and 119.2MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 93.65ms. Allocated memory is still 211.8MB. Free memory was 119.2MB in the beginning and 111.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1626]: 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, 102 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 1337 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 811 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 18/18 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: 1412]: Procedure Contract for printLine Derived contract for procedure printLine. Requires: (STATIC_CONST_FIVE == 5) Ensures: (STATIC_CONST_FIVE == 5) - ProcedureContractResult [Line: 1426]: Procedure Contract for printIntLine Derived contract for procedure printIntLine. Requires: (STATIC_CONST_FIVE == 5) Ensures: (STATIC_CONST_FIVE == 5) RESULT: Ultimate proved your program to be correct! [2024-10-13 15:15:44,879 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