./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dbc302d6bacfc43fef9e17f50afeb36633d0d3ddcc94212983f9873139dfb9cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:31:43,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:31:43,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:31:43,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:31:43,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:31:43,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:31:43,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:31:43,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:31:43,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:31:43,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:31:43,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:31:43,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:31:43,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:31:43,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:31:43,749 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:31:43,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:31:43,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:31:43,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:31:43,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:31:43,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:31:43,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:31:43,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:31:43,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:31:43,756 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:31:43,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:31:43,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:31:43,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:31:43,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:31:43,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:31:43,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:31:43,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:31:43,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:43,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:31:43,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:31:43,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:31:43,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:31:43,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:31:43,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:31:43,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:31:43,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:31:43,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:31:43,760 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-clean/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-clean/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 -> dbc302d6bacfc43fef9e17f50afeb36633d0d3ddcc94212983f9873139dfb9cd [2024-10-11 22:31:44,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:31:44,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:31:44,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:31:44,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:31:44,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:31:44,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:45,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:31:45,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:31:45,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:45,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b667069b5/ee3fd435b34049a6aaf923ab8db09d9f/FLAG20fcdd0a6 [2024-10-11 22:31:46,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b667069b5/ee3fd435b34049a6aaf923ab8db09d9f [2024-10-11 22:31:46,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:31:46,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:31:46,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:46,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:31:46,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:31:46,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:46" (1/1) ... [2024-10-11 22:31:46,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1450a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:46, skipping insertion in model container [2024-10-11 22:31:46,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:46" (1/1) ... [2024-10-11 22:31:46,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:31:46,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:46,992 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:31:47,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:47,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:31:47,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47 WrapperNode [2024-10-11 22:31:47,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:47,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:47,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:31:47,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:31:47,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,333 INFO L138 Inliner]: procedures = 498, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2024-10-11 22:31:47,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:47,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:31:47,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:31:47,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:31:47,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,362 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:31:47,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:31:47,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:31:47,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:31:47,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:31:47,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:31:47,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:31:47,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:31:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:31:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:31:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:31:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:31:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:31:47,639 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:31:47,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:31:47,882 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-11 22:31:47,882 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:31:47,918 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:31:47,919 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:31:47,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:47 BoogieIcfgContainer [2024-10-11 22:31:47,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:31:47,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:31:47,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:31:47,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:31:47,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:31:46" (1/3) ... [2024-10-11 22:31:47,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cabd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:47, skipping insertion in model container [2024-10-11 22:31:47,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (2/3) ... [2024-10-11 22:31:47,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cabd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:47, skipping insertion in model container [2024-10-11 22:31:47,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:47" (3/3) ... [2024-10-11 22:31:47,928 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:47,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:31:47,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:31:48,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:31:48,022 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;@679bf217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:31:48,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:31:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:31:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 22:31:48,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:48,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:48,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:48,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash 185180791, now seen corresponding path program 1 times [2024-10-11 22:31:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996262090] [2024-10-11 22:31:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:31:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:31:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996262090] [2024-10-11 22:31:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996262090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:31:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858340251] [2024-10-11 22:31:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:31:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:31:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:31:48,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:31:48,374 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 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 6.0) internal successors, (12), 3 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-10-11 22:31:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:48,409 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2024-10-11 22:31:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:31:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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 14 [2024-10-11 22:31:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:48,418 INFO L225 Difference]: With dead ends: 36 [2024-10-11 22:31:48,418 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 22:31:48,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:31:48,424 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:48,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:31:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 22:31:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 22:31:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 22:31:48,457 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 14 [2024-10-11 22:31:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:48,458 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 22:31:48,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 22:31:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 22:31:48,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:48,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:31:48,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1445637352, now seen corresponding path program 1 times [2024-10-11 22:31:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080250288] [2024-10-11 22:31:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:31:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:31:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080250288] [2024-10-11 22:31:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080250288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:48,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:31:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165693081] [2024-10-11 22:31:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:31:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:31:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:31:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:31:48,881 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:48,949 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-11 22:31:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:31:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2024-10-11 22:31:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:48,950 INFO L225 Difference]: With dead ends: 37 [2024-10-11 22:31:48,950 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 22:31:48,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:31:48,951 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:48,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:31:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 22:31:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 22:31:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-10-11 22:31:48,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2024-10-11 22:31:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:48,962 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-10-11 22:31:48,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-10-11 22:31:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 22:31:48,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:48,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:31:48,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -846181042, now seen corresponding path program 1 times [2024-10-11 22:31:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816291814] [2024-10-11 22:31:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:48,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:31:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:49,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 22:31:49,050 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:31:49,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:31:49,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:31:49,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:31:49,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 22:31:49,083 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:31:49,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:31:49 BoogieIcfgContainer [2024-10-11 22:31:49,090 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:31:49,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:31:49,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:31:49,091 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:31:49,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:47" (3/4) ... [2024-10-11 22:31:49,094 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:31:49,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:31:49,096 INFO L158 Benchmark]: Toolchain (without parser) took 2950.44ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 83.4MB in the beginning and 112.5MB in the end (delta: -29.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,097 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 140.5MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:49,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1124.19ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 83.1MB in the beginning and 109.3MB in the end (delta: -26.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.28ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 106.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,099 INFO L158 Benchmark]: Boogie Preprocessor took 41.61ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,100 INFO L158 Benchmark]: RCFGBuilder took 542.86ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 84.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,100 INFO L158 Benchmark]: TraceAbstraction took 1169.05ms. Allocated memory is still 180.4MB. Free memory was 84.2MB in the beginning and 112.5MB in the end (delta: -28.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:49,100 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 180.4MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:49,102 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.20ms. Allocated memory is still 140.5MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1124.19ms. Allocated memory was 140.5MB in the beginning and 180.4MB in the end (delta: 39.8MB). Free memory was 83.1MB in the beginning and 109.3MB in the end (delta: -26.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.28ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 106.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.61ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.86ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 84.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1169.05ms. Allocated memory is still 180.4MB. Free memory was 84.2MB in the beginning and 112.5MB in the end (delta: -28.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 180.4MB. Free memory is still 112.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: 1555]: 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 1562. 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); [L1562] 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) [L1562] 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] [L1563] CALL CWE190_Integer_Overflow__int_rand_add_61_bad() [L1551] int data; [L1552] data = 0 [L1553] CALL, EXPR CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1569] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1569] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) 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] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() 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] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1570] return data; [L1553] RET, EXPR CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1553] data = CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1555] data + 1 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: 1555]: 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, 36 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 78 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 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-10-11 22:31:49,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dbc302d6bacfc43fef9e17f50afeb36633d0d3ddcc94212983f9873139dfb9cd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:31:51,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:31:51,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:31:51,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:31:51,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:31:51,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:31:51,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:31:51,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:31:51,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:31:51,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:31:51,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:31:51,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:31:51,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:31:51,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:31:51,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:31:51,493 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:31:51,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:31:51,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:31:51,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:31:51,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:31:51,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:31:51,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:31:51,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:31:51,495 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:31:51,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:31:51,496 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:31:51,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:31:51,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:31:51,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:31:51,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:31:51,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:31:51,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:31:51,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:31:51,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:31:51,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:51,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:31:51,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:31:51,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:31:51,501 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:31:51,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:31:51,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:31:51,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:31:51,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:31:51,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:31:51,503 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:31:51,504 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-clean/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-clean/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 -> dbc302d6bacfc43fef9e17f50afeb36633d0d3ddcc94212983f9873139dfb9cd [2024-10-11 22:31:51,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:31:51,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:31:51,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:31:51,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:31:51,870 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:31:51,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:53,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:31:53,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:31:53,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:53,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d856f662e/d8b87c01016b4740bcc40f4df5db6450/FLAG0a398169c [2024-10-11 22:31:53,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d856f662e/d8b87c01016b4740bcc40f4df5db6450 [2024-10-11 22:31:53,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:31:53,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:31:53,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:53,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:31:53,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:31:53,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:53" (1/1) ... [2024-10-11 22:31:53,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e33ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:53, skipping insertion in model container [2024-10-11 22:31:53,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:53" (1/1) ... [2024-10-11 22:31:53,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:31:54,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:54,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:31:54,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:54,810 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:31:54,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54 WrapperNode [2024-10-11 22:31:54,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:54,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:54,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:31:54,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:31:54,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,892 INFO L138 Inliner]: procedures = 503, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2024-10-11 22:31:54,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:54,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:31:54,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:31:54,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:31:54,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,928 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:31:54,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:31:54,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:31:54,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:31:54,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:31:54,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (1/1) ... [2024-10-11 22:31:54,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:31:55,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:31:55,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:31:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:31:55,053 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:31:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:31:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:31:55,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:31:55,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:31:55,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:31:55,387 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 22:31:55,387 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:31:55,432 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:31:55,432 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:31:55,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:55 BoogieIcfgContainer [2024-10-11 22:31:55,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:31:55,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:31:55,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:31:55,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:31:55,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:31:53" (1/3) ... [2024-10-11 22:31:55,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489d994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:55, skipping insertion in model container [2024-10-11 22:31:55,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:54" (2/3) ... [2024-10-11 22:31:55,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489d994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:55, skipping insertion in model container [2024-10-11 22:31:55,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:55" (3/3) ... [2024-10-11 22:31:55,444 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_61_bad.i [2024-10-11 22:31:55,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:31:55,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:31:55,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:31:55,530 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;@6adc42e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:31:55,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:31:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:31:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 22:31:55,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:55,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:55,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1498897493, now seen corresponding path program 1 times [2024-10-11 22:31:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:31:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241745512] [2024-10-11 22:31:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:55,564 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-10-11 22:31:55,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:31:55,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 22:31:55,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:55,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:31:55,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:31:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:55,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:31:55,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:31:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241745512] [2024-10-11 22:31:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241745512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:55,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:55,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:31:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677736115] [2024-10-11 22:31:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:55,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:31:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:31:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:31:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:31:55,743 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:55,774 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-11 22:31:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:31:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 22:31:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:55,782 INFO L225 Difference]: With dead ends: 16 [2024-10-11 22:31:55,783 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 22:31:55,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:31:55,788 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:55,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:31:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 22:31:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 22:31:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-11 22:31:55,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-10-11 22:31:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:55,825 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-11 22:31:55,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:31:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-11 22:31:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:31:55,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:55,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:55,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 22:31:56,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash 778818028, now seen corresponding path program 1 times [2024-10-11 22:31:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:31:56,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490608132] [2024-10-11 22:31:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:56,035 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-10-11 22:31:56,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:31:56,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 22:31:56,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:56,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:31:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:56,198 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 22:31:56,198 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:31:56,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:31:56,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:31:56,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 22:31:56,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 22:31:56,405 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 22:31:56,430 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:31:56,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:31:56 BoogieIcfgContainer [2024-10-11 22:31:56,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:31:56,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:31:56,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:31:56,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:31:56,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:55" (3/4) ... [2024-10-11 22:31:56,438 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:31:56,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:31:56,440 INFO L158 Benchmark]: Toolchain (without parser) took 2648.11ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 45.1MB in the beginning and 40.0MB in the end (delta: 5.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,440 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:56,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1017.97ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 44.8MB in the beginning and 46.3MB in the end (delta: -1.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.60ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 43.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,441 INFO L158 Benchmark]: Boogie Preprocessor took 69.99ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,442 INFO L158 Benchmark]: RCFGBuilder took 468.90ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 45.5MB in the end (delta: -5.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,442 INFO L158 Benchmark]: TraceAbstraction took 997.30ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 40.4MB in the end (delta: 4.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-11 22:31:56,443 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 40.0MB in the end (delta: 471.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:56,445 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.09ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1017.97ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 44.8MB in the beginning and 46.3MB in the end (delta: -1.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.60ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 43.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.99ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 468.90ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 45.5MB in the end (delta: -5.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * TraceAbstraction took 997.30ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 40.4MB in the end (delta: 4.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 40.0MB in the end (delta: 471.9kB). 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: 1555]: 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 1562. 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); [L1562] 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) [L1562] 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] [L1563] CALL CWE190_Integer_Overflow__int_rand_add_61_bad() [L1551] int data; [L1552] data = 0 [L1553] CALL, EXPR CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1569] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1569] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1570] return data; [L1553] RET, EXPR CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1553] data = CWE190_Integer_Overflow__int_rand_add_61b_badSource(data) [L1555] data + 1 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: 1555]: 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, 16 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 44 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-10-11 22:31:56,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample