./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_postinc_41_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_41_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e32ea3d9121f87af2c39b08d496f1c5082254565bdbb6379132391321e440a01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:18:26,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:18:26,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:18:26,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:18:26,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:18:26,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:18:26,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:18:26,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:18:26,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:18:26,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:18:26,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:18:26,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:18:26,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:18:26,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:18:26,716 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:18:26,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:18:26,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:18:26,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:18:26,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:18:26,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:18:26,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:18:26,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:18:26,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:18:26,720 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:18:26,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:18:26,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:18:26,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:18:26,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:18:26,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:18:26,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:18:26,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:18:26,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:18:26,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:18:26,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:18:26,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:18:26,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:18:26,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:18:26,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:18:26,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:18:26,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:18:26,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:18:26,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e32ea3d9121f87af2c39b08d496f1c5082254565bdbb6379132391321e440a01 [2024-10-13 15:18:27,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:18:27,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:18:27,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:18:27,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:18:27,079 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:18:27,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_postinc_41_bad.i [2024-10-13 15:18:28,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:18:28,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:18:28,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_41_bad.i [2024-10-13 15:18:28,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163ffb98e/de3c14fbe7c44e98a4150ac5b734ccfe/FLAG3be3771bb [2024-10-13 15:18:29,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163ffb98e/de3c14fbe7c44e98a4150ac5b734ccfe [2024-10-13 15:18:29,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:18:29,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:18:29,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:18:29,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:18:29,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:18:29,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:29" (1/1) ... [2024-10-13 15:18:29,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c12b8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:29, skipping insertion in model container [2024-10-13 15:18:29,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:29" (1/1) ... [2024-10-13 15:18:29,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:18:29,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:18:29,890 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:18:29,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:18:30,097 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:18:30,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30 WrapperNode [2024-10-13 15:18:30,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:18:30,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:18:30,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:18:30,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:18:30,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,186 INFO L138 Inliner]: procedures = 498, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 101 [2024-10-13 15:18:30,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:18:30,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:18:30,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:18:30,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:18:30,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,212 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:18:30,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:18:30,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:18:30,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:18:30,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:18:30,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (1/1) ... [2024-10-13 15:18:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:18:30,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:18:30,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:18:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:18:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:18:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:18:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:18:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:18:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:18:30,519 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:18:30,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:18:30,679 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-13 15:18:30,679 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:18:30,714 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:18:30,715 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:18:30,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:30 BoogieIcfgContainer [2024-10-13 15:18:30,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:18:30,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:18:30,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:18:30,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:18:30,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:18:29" (1/3) ... [2024-10-13 15:18:30,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44113b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:30, skipping insertion in model container [2024-10-13 15:18:30,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:30" (2/3) ... [2024-10-13 15:18:30,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44113b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:30, skipping insertion in model container [2024-10-13 15:18:30,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:30" (3/3) ... [2024-10-13 15:18:30,724 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_41_bad.i [2024-10-13 15:18:30,740 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:18:30,740 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 15:18:30,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:18:30,799 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;@14d8007f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:18:30,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 15:18:30,803 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-13 15:18:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 15:18:30,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:18:30,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:18:30,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 15:18:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:18:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 185180076, now seen corresponding path program 1 times [2024-10-13 15:18:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:18:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377468867] [2024-10-13 15:18:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:18:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:18:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:18:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:18:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:18:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:18:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:18:31,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377468867] [2024-10-13 15:18:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377468867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:18:31,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:18:31,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:18:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049485923] [2024-10-13 15:18:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:18:31,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:18:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:18:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:18:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:18:31,268 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-13 15:18:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:18:31,304 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2024-10-13 15:18:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:18:31,306 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-13 15:18:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:18:31,314 INFO L225 Difference]: With dead ends: 36 [2024-10-13 15:18:31,315 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 15:18:31,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:18:31,323 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:18:31,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:18:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 15:18:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 15:18:31,366 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-13 15:18:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-13 15:18:31,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 14 [2024-10-13 15:18:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:18:31,370 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-13 15:18:31,370 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-13 15:18:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-13 15:18:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 15:18:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:18:31,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:18:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:18:31,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 15:18:31,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:18:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1445615185, now seen corresponding path program 1 times [2024-10-13 15:18:31,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:18:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190571790] [2024-10-13 15:18:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:18:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:18:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:18:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:18:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:18:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:18:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:18:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190571790] [2024-10-13 15:18:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190571790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:18:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:18:31,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 15:18:31,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625742843] [2024-10-13 15:18:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:18:31,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 15:18:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:18:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 15:18:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 15:18:31,689 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-13 15:18:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:18:31,753 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-13 15:18:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 15:18:31,754 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-13 15:18:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:18:31,756 INFO L225 Difference]: With dead ends: 37 [2024-10-13 15:18:31,757 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 15:18:31,758 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-13 15:18:31,759 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-13 15:18:31,761 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-13 15:18:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 15:18:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 15:18:31,766 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-13 15:18:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-10-13 15:18:31,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2024-10-13 15:18:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:18:31,767 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-10-13 15:18:31,767 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-13 15:18:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-10-13 15:18:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 15:18:31,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:18:31,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:18:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:18:31,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 15:18:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:18:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -846203209, now seen corresponding path program 1 times [2024-10-13 15:18:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:18:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299247238] [2024-10-13 15:18:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:18:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:18:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 15:18:31,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 15:18:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 15:18:31,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 15:18:31,840 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 15:18:31,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-13 15:18:31,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-13 15:18:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:18:31,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 15:18:31,875 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:18:31,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:18:31 BoogieIcfgContainer [2024-10-13 15:18:31,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:18:31,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:18:31,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:18:31,884 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:18:31,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:30" (3/4) ... [2024-10-13 15:18:31,887 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 15:18:31,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:18:31,889 INFO L158 Benchmark]: Toolchain (without parser) took 2802.96ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 105.8MB in the beginning and 135.8MB in the end (delta: -30.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,889 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 100.7MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:18:31,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1010.13ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 40.6MB in the end (delta: 65.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.81ms. Allocated memory is still 155.2MB. Free memory was 40.6MB in the beginning and 122.3MB in the end (delta: -81.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,892 INFO L158 Benchmark]: Boogie Preprocessor took 38.52ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 119.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,892 INFO L158 Benchmark]: RCFGBuilder took 489.23ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 108.6MB in the end (delta: 10.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,895 INFO L158 Benchmark]: TraceAbstraction took 1165.26ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 107.9MB in the beginning and 135.8MB in the end (delta: -27.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-13 15:18:31,895 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 201.3MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:18:31,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 100.7MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1010.13ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 40.6MB in the end (delta: 65.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.81ms. Allocated memory is still 155.2MB. Free memory was 40.6MB in the beginning and 122.3MB in the end (delta: -81.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.52ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 119.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 489.23ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 108.6MB in the end (delta: 10.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1165.26ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 107.9MB in the beginning and 135.8MB in the end (delta: -27.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 201.3MB. Free memory is still 135.8MB. 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: 1551]: 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 1566. 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); [L1566] 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) [L1566] 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] [L1567] CALL CWE190_Integer_Overflow__int_rand_postinc_41_bad() [L1558] int data; [L1559] data = 0 [L1560] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1560] 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] [L1560] 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] [L1560] 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] [L1560] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1561] CALL badSink(data) [L1551] data++ 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: 1551]: 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, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 79 mSDtfsCounter, 60 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.0s 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, 61 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-13 15:18:31,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_41_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e32ea3d9121f87af2c39b08d496f1c5082254565bdbb6379132391321e440a01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:18:34,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:18:34,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 15:18:34,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:18:34,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:18:34,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 15:18:34,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:18:34,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:18:34,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:18:34,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:18:34,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:18:34,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:18:34,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:18:34,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:18:34,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:18:34,256 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:18:34,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:18:34,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:18:34,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:18:34,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:18:34,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:18:34,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:18:34,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 15:18:34,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 15:18:34,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:18:34,259 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:18:34,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 15:18:34,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:18:34,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:18:34,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:18:34,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:18:34,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:18:34,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:18:34,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:18:34,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:18:34,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:18:34,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:18:34,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:18:34,263 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 15:18:34,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 15:18:34,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:18:34,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:18:34,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:18:34,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:18:34,265 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 15:18:34,265 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e32ea3d9121f87af2c39b08d496f1c5082254565bdbb6379132391321e440a01 [2024-10-13 15:18:34,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:18:34,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:18:34,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:18:34,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:18:34,624 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:18:34,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_41_bad.i [2024-10-13 15:18:36,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:18:36,448 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:18:36,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_41_bad.i [2024-10-13 15:18:36,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b6c3931/93d6155107344a6794403e2379ac16eb/FLAGefac1a6cd [2024-10-13 15:18:36,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b6c3931/93d6155107344a6794403e2379ac16eb [2024-10-13 15:18:36,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:18:36,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:18:36,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:18:36,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:18:36,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:18:36,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:36" (1/1) ... [2024-10-13 15:18:36,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0a3d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:36, skipping insertion in model container [2024-10-13 15:18:36,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:36" (1/1) ... [2024-10-13 15:18:36,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:18:37,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:18:37,581 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:18:37,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:18:37,772 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:18:37,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37 WrapperNode [2024-10-13 15:18:37,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:18:37,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:18:37,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:18:37,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:18:37,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,839 INFO L138 Inliner]: procedures = 503, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2024-10-13 15:18:37,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:18:37,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:18:37,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:18:37,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:18:37,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,875 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:18:37,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:18:37,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:18:37,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:18:37,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:18:37,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (1/1) ... [2024-10-13 15:18:37,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:18:37,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:18:37,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:18:37,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:18:37,986 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:18:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:18:38,177 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:18:38,180 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:18:38,323 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 15:18:38,323 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:18:38,365 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:18:38,366 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:18:38,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:38 BoogieIcfgContainer [2024-10-13 15:18:38,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:18:38,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:18:38,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:18:38,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:18:38,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:18:36" (1/3) ... [2024-10-13 15:18:38,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a76a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:38, skipping insertion in model container [2024-10-13 15:18:38,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:37" (2/3) ... [2024-10-13 15:18:38,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a76a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:38, skipping insertion in model container [2024-10-13 15:18:38,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:38" (3/3) ... [2024-10-13 15:18:38,376 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_41_bad.i [2024-10-13 15:18:38,404 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:18:38,404 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 15:18:38,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:18:38,478 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;@6ac75e89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:18:38,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 15:18:38,482 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-13 15:18:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 15:18:38,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:18:38,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:18:38,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 15:18:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:18:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1302384734, now seen corresponding path program 1 times [2024-10-13 15:18:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:18:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658985710] [2024-10-13 15:18:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:18:38,516 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-13 15:18:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:18:38,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 15:18:38,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 15:18:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:18:38,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 15:18:38,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 15:18:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:18:38,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 15:18:38,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 15:18:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658985710] [2024-10-13 15:18:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658985710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:18:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:18:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 15:18:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639220074] [2024-10-13 15:18:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:18:38,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 15:18:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 15:18:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 15:18:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 15:18:38,693 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-13 15:18:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:18:38,715 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-13 15:18:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 15:18:38,717 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-13 15:18:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:18:38,723 INFO L225 Difference]: With dead ends: 16 [2024-10-13 15:18:38,724 INFO L226 Difference]: Without dead ends: 12 [2024-10-13 15:18:38,727 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-13 15:18:38,730 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:18:38,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:18:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-13 15:18:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 15:18:38,757 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-13 15:18:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-13 15:18:38,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-10-13 15:18:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:18:38,759 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 15:18:38,759 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-13 15:18:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-13 15:18:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 15:18:38,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:18:38,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:18:38,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 15:18:38,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 15:18:38,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-13 15:18:38,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:18:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1719221037, now seen corresponding path program 1 times [2024-10-13 15:18:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 15:18:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433019641] [2024-10-13 15:18:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:18:38,963 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-13 15:18:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 15:18:38,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 15:18:38,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 15:18:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 15:18:39,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 15:18:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 15:18:39,136 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 15:18:39,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 15:18:39,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-13 15:18:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-13 15:18:39,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 15:18:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 15:18:39,344 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 15:18:39,368 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:18:39,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:18:39 BoogieIcfgContainer [2024-10-13 15:18:39,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:18:39,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:18:39,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:18:39,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:18:39,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:38" (3/4) ... [2024-10-13 15:18:39,377 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 15:18:39,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:18:39,378 INFO L158 Benchmark]: Toolchain (without parser) took 2705.43ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 46.8MB in the beginning and 38.9MB in the end (delta: 7.9MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,379 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:18:39,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1098.63ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 48.3MB in the end (delta: -1.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.91ms. Allocated memory is still 77.6MB. Free memory was 48.3MB in the beginning and 45.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,380 INFO L158 Benchmark]: Boogie Preprocessor took 67.65ms. Allocated memory is still 77.6MB. Free memory was 45.5MB in the beginning and 43.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,381 INFO L158 Benchmark]: RCFGBuilder took 457.29ms. Allocated memory is still 77.6MB. Free memory was 42.5MB in the beginning and 26.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,381 INFO L158 Benchmark]: TraceAbstraction took 1005.07ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 39.5MB in the end (delta: -13.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-10-13 15:18:39,382 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 96.5MB. Free memory was 39.5MB in the beginning and 38.9MB in the end (delta: 602.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:18:39,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1098.63ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 48.3MB in the end (delta: -1.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.91ms. Allocated memory is still 77.6MB. Free memory was 48.3MB in the beginning and 45.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.65ms. Allocated memory is still 77.6MB. Free memory was 45.5MB in the beginning and 43.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.29ms. Allocated memory is still 77.6MB. Free memory was 42.5MB in the beginning and 26.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1005.07ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 39.5MB in the end (delta: -13.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 96.5MB. Free memory was 39.5MB in the beginning and 38.9MB in the end (delta: 602.5kB). 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: 1551]: 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 1566. 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); [L1566] 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) [L1566] 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] [L1567] CALL CWE190_Integer_Overflow__int_rand_postinc_41_bad() [L1558] int data; [L1559] data = 0 [L1560] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1560] 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] [L1560] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1561] CALL badSink(data) [L1551] data++ 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: 1551]: 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, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 3 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 45 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-13 15:18:39,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample