./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.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 44965c5977815c8fa40d2761985e5995f728380d5ba83bccfd4df0a41bd581d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:55:13,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:55:13,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 20:55:13,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:55:13,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:55:13,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:55:13,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:55:13,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:55:13,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:55:13,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:55:13,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:55:13,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:55:13,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:55:13,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:55:13,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:55:13,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:55:13,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:55:13,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 20:55:13,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:55:13,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:55:13,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:55:13,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:55:13,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:55:13,369 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:55:13,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:55:13,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:55:13,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:55:13,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:55:13,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:55:13,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 20:55:13,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 20:55:13,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:55:13,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:55:13,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:55:13,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:55:13,372 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 -> 44965c5977815c8fa40d2761985e5995f728380d5ba83bccfd4df0a41bd581d3 [2024-11-10 20:55:13,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:55:13,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:55:13,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:55:13,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:55:13,618 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:55:13,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:14,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:55:15,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:55:15,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:15,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ac77ee2/b41e071efa3e4df6a574b8ec13cbf3d6/FLAG1f25bccb3 [2024-11-10 20:55:15,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ac77ee2/b41e071efa3e4df6a574b8ec13cbf3d6 [2024-11-10 20:55:15,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:55:15,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:55:15,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:55:15,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:55:15,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:55:15,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:15" (1/1) ... [2024-11-10 20:55:15,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197ffd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:15, skipping insertion in model container [2024-11-10 20:55:15,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:15" (1/1) ... [2024-11-10 20:55:15,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:55:16,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:55:16,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:55:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:55:16,228 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:55:16,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16 WrapperNode [2024-11-10 20:55:16,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:55:16,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:55:16,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:55:16,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:55:16,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,279 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2024-11-10 20:55:16,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:55:16,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:55:16,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:55:16,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:55:16,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,296 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 20:55:16,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:55:16,310 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:55:16,310 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:55:16,310 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:55:16,311 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (1/1) ... [2024-11-10 20:55:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:55:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:55:16,361 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-11-10 20:55:16,365 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-11-10 20:55:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:55:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:55:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:55:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:55:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:55:16,552 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:55:16,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:55:16,642 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 20:55:16,642 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:55:16,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:55:16,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:55:16,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:16 BoogieIcfgContainer [2024-11-10 20:55:16,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:55:16,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:55:16,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:55:16,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:55:16,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:55:15" (1/3) ... [2024-11-10 20:55:16,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab02ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:16, skipping insertion in model container [2024-11-10 20:55:16,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:16" (2/3) ... [2024-11-10 20:55:16,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab02ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:16, skipping insertion in model container [2024-11-10 20:55:16,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:16" (3/3) ... [2024-11-10 20:55:16,666 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:16,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:55:16,680 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:55:16,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:55:16,737 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;@78d2c07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:55:16,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:55:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-11-10 20:55:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:55:16,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:16,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:16,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:16,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1180179906, now seen corresponding path program 1 times [2024-11-10 20:55:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:55:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263433994] [2024-11-10 20:55:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:55:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:55:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:55:16,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:55:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263433994] [2024-11-10 20:55:16,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263433994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:55:16,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:55:16,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:55:16,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041807635] [2024-11-10 20:55:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:55:17,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:55:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:55:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:55:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:55:17,025 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:17,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:55:17,062 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-10 20:55:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:55:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-10 20:55:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:55:17,069 INFO L225 Difference]: With dead ends: 41 [2024-11-10 20:55:17,069 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:55:17,072 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-11-10 20:55:17,075 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:55:17,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:55:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:55:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-10 20:55:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-11-10 20:55:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-10 20:55:17,106 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2024-11-10 20:55:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:55:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-10 20:55:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-10 20:55:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:55:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:17,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 20:55:17,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1180150115, now seen corresponding path program 1 times [2024-11-10 20:55:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:55:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591044697] [2024-11-10 20:55:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:55:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:55:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:55:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:55:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591044697] [2024-11-10 20:55:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591044697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:55:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:55:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 20:55:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137637539] [2024-11-10 20:55:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:55:17,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:55:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:55:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:55:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:55:17,203 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:55:17,211 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-10 20:55:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:55:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-10 20:55:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:55:17,212 INFO L225 Difference]: With dead ends: 20 [2024-11-10 20:55:17,212 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 20:55:17,213 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-11-10 20:55:17,214 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:55:17,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:55:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 20:55:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 20:55:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-11-10 20:55:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-10 20:55:17,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2024-11-10 20:55:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:55:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-10 20:55:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-10 20:55:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 20:55:17,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:17,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 20:55:17,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2069128559, now seen corresponding path program 1 times [2024-11-10 20:55:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:55:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716488818] [2024-11-10 20:55:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:55:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:55:17,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:55:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:55:17,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 20:55:17,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:55:17,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:55:17,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:55:17,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 20:55:17,272 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:55:17,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:55:17,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:55:17 BoogieIcfgContainer [2024-11-10 20:55:17,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:55:17,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:55:17,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:55:17,295 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:55:17,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:16" (3/4) ... [2024-11-10 20:55:17,298 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:55:17,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:55:17,299 INFO L158 Benchmark]: Toolchain (without parser) took 1867.52ms. Allocated memory is still 169.9MB. Free memory was 132.4MB in the beginning and 87.5MB in the end (delta: 44.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,300 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:55:17,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 795.71ms. Allocated memory is still 169.9MB. Free memory was 132.4MB in the beginning and 66.3MB in the end (delta: 66.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.40ms. Allocated memory is still 169.9MB. Free memory was 66.3MB in the beginning and 63.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,303 INFO L158 Benchmark]: Boogie Preprocessor took 25.22ms. Allocated memory is still 169.9MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,303 INFO L158 Benchmark]: IcfgBuilder took 346.56ms. Allocated memory is still 169.9MB. Free memory was 61.1MB in the beginning and 128.4MB in the end (delta: -67.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,303 INFO L158 Benchmark]: TraceAbstraction took 636.57ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 87.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 20:55:17,303 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 169.9MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:55:17,305 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.11ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 795.71ms. Allocated memory is still 169.9MB. Free memory was 132.4MB in the beginning and 66.3MB in the end (delta: 66.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.40ms. Allocated memory is still 169.9MB. Free memory was 66.3MB in the beginning and 63.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.22ms. Allocated memory is still 169.9MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 346.56ms. Allocated memory is still 169.9MB. Free memory was 61.1MB in the beginning and 128.4MB in the end (delta: -67.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 636.57ms. Allocated memory is still 169.9MB. Free memory was 127.3MB in the beginning and 87.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 169.9MB. Free memory is still 87.5MB. There was no memory consumed. 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 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE190_Integer_Overflow__int_max_multiply_14_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalFive==5 [L1554] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalFive==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 36 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:55:17,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 44965c5977815c8fa40d2761985e5995f728380d5ba83bccfd4df0a41bd581d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:55:19,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:55:19,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 20:55:19,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:55:19,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:55:19,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 20:55:19,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:55:19,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:55:19,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:55:19,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:55:19,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:55:19,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:55:19,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:55:19,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:55:19,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:55:19,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:55:19,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:55:19,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:55:19,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:55:19,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:55:19,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:55:19,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:55:19,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:55:19,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:55:19,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:55:19,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:55:19,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:55:19,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:55:19,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:55:19,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:55:19,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:55:19,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:55:19,180 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 20:55:19,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 20:55:19,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:55:19,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:55:19,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:55:19,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:55:19,181 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 -> 44965c5977815c8fa40d2761985e5995f728380d5ba83bccfd4df0a41bd581d3 [2024-11-10 20:55:19,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:55:19,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:55:19,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:55:19,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:55:19,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:55:19,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:20,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:55:21,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:55:21,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:21,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a1ff314/42ece1b1d88b4673a668bf5e809f1e6c/FLAG13e4030b2 [2024-11-10 20:55:21,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a1ff314/42ece1b1d88b4673a668bf5e809f1e6c [2024-11-10 20:55:21,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:55:21,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:55:21,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:55:21,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:55:21,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:55:21,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786841dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21, skipping insertion in model container [2024-11-10 20:55:21,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:55:21,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:55:21,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:55:21,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:55:21,890 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:55:21,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21 WrapperNode [2024-11-10 20:55:21,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:55:21,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:55:21,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:55:21,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:55:21,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,939 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2024-11-10 20:55:21,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:55:21,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:55:21,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:55:21,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:55:21,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,968 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 20:55:21,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:55:21,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:55:21,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:55:21,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:55:21,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (1/1) ... [2024-11-10 20:55:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:55:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:55:22,013 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-11-10 20:55:22,016 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-11-10 20:55:22,050 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:55:22,050 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:55:22,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:55:22,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:55:22,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:55:22,184 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:55:22,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:55:22,265 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 20:55:22,268 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:55:22,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:55:22,278 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:55:22,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:22 BoogieIcfgContainer [2024-11-10 20:55:22,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:55:22,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:55:22,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:55:22,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:55:22,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:55:21" (1/3) ... [2024-11-10 20:55:22,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f442577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:22, skipping insertion in model container [2024-11-10 20:55:22,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:21" (2/3) ... [2024-11-10 20:55:22,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f442577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:22, skipping insertion in model container [2024-11-10 20:55:22,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:22" (3/3) ... [2024-11-10 20:55:22,286 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_14_bad.i [2024-11-10 20:55:22,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:55:22,298 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:55:22,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:55:22,356 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;@14e90c2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:55:22,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:55:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-11-10 20:55:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:55:22,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:22,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:22,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:22,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1180179906, now seen corresponding path program 1 times [2024-11-10 20:55:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:55:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63772206] [2024-11-10 20:55:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:22,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:22,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:55:22,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:55:22,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 20:55:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:22,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:55:22,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:55:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:55:22,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:55:22,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:55:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63772206] [2024-11-10 20:55:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63772206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:55:22,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:55:22,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:55:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100933070] [2024-11-10 20:55:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:55:22,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:55:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:55:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:55:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:55:22,567 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:55:22,605 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-10 20:55:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:55:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-10 20:55:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:55:22,612 INFO L225 Difference]: With dead ends: 41 [2024-11-10 20:55:22,612 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:55:22,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-10 20:55:22,618 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:55:22,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:55:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:55:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-10 20:55:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-11-10 20:55:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-10 20:55:22,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2024-11-10 20:55:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:55:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-10 20:55:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-10 20:55:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-10 20:55:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:55:22,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:22,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:22,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 20:55:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:22,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1180150115, now seen corresponding path program 1 times [2024-11-10 20:55:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:55:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199079740] [2024-11-10 20:55:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:55:22,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:55:22,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 20:55:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:55:22,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:55:22,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:55:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:55:22,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:55:22,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:55:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199079740] [2024-11-10 20:55:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199079740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:55:22,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:55:22,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:55:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931373486] [2024-11-10 20:55:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:55:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:55:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:55:22,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:55:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:55:22,959 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11-10 20:55:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:55:22,964 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-10 20:55:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:55:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-11-10 20:55:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:55:22,966 INFO L225 Difference]: With dead ends: 20 [2024-11-10 20:55:22,966 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 20:55:22,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-10 20:55:22,967 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:55:22,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:55:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 20:55:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 20:55:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-11-10 20:55:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-10 20:55:22,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2024-11-10 20:55:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:55:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-10 20:55:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11-10 20:55:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-10 20:55:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 20:55:22,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:55:22,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:55:22,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 20:55:23,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:23,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:55:23,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:55:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2069128559, now seen corresponding path program 1 times [2024-11-10 20:55:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:55:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517482633] [2024-11-10 20:55:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:55:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:55:23,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:55:23,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 20:55:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:55:23,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:55:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:55:23,292 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 20:55:23,292 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:55:23,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:55:23,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:55:23,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 20:55:23,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:55:23,500 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:55:23,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:55:23,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:55:23 BoogieIcfgContainer [2024-11-10 20:55:23,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:55:23,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:55:23,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:55:23,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:55:23,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:22" (3/4) ... [2024-11-10 20:55:23,524 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:55:23,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:55:23,526 INFO L158 Benchmark]: Toolchain (without parser) took 2413.28ms. Allocated memory was 65.0MB in the beginning and 111.1MB in the end (delta: 46.1MB). Free memory was 39.1MB in the beginning and 72.5MB in the end (delta: -33.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-10 20:55:23,541 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:55:23,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.91ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 39.0MB in the beginning and 53.5MB in the end (delta: -14.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-10 20:55:23,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 86.0MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 20:55:23,546 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 86.0MB. Free memory was 50.7MB in the beginning and 48.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:55:23,546 INFO L158 Benchmark]: IcfgBuilder took 292.87ms. Allocated memory is still 86.0MB. Free memory was 48.1MB in the beginning and 35.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 20:55:23,546 INFO L158 Benchmark]: TraceAbstraction took 1239.46ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 34.4MB in the beginning and 73.2MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:55:23,546 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 72.5MB in the end (delta: 703.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:55:23,548 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.12ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.91ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 39.0MB in the beginning and 53.5MB in the end (delta: -14.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 86.0MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 86.0MB. Free memory was 50.7MB in the beginning and 48.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 292.87ms. Allocated memory is still 86.0MB. Free memory was 48.1MB in the beginning and 35.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1239.46ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 34.4MB in the beginning and 73.2MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 72.5MB in the end (delta: 703.8kB). There was no memory consumed. 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 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE190_Integer_Overflow__int_max_multiply_14_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalFive==5 [L1554] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalFive==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 36 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:55:23,588 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: UNKNOWN: Overapproximated counterexample