./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_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 142c16f836549b8d04d87269f1e0aca006cd15d05060605c5152feadc89b66b7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:41:37,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:41:37,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:41:37,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:41:37,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:41:37,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:41:37,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:41:37,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:41:37,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:41:37,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:41:37,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:41:37,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:41:37,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:41:37,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:41:37,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:41:37,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:41:37,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:41:37,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:41:37,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:41:37,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:41:37,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:41:37,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:41:37,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:41:37,759 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:41:37,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:41:37,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:41:37,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:41:37,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:41:37,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:41:37,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:41:37,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:41:37,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:41:37,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:41:37,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:41:37,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:41:37,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:41:37,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:41:37,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:41:37,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:41:37,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:41:37,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:41:37,765 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 -> 142c16f836549b8d04d87269f1e0aca006cd15d05060605c5152feadc89b66b7 [2024-11-09 13:41:38,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:41:38,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:41:38,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:41:38,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:41:38,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:41:38,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:39,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:41:39,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:41:39,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:39,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8225894ac/5c1c6efb548145b2b38a0a3d2a474a4d/FLAG8cbf70f73 [2024-11-09 13:41:40,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8225894ac/5c1c6efb548145b2b38a0a3d2a474a4d [2024-11-09 13:41:40,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:41:40,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:41:40,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:41:40,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:41:40,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:41:40,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:40" (1/1) ... [2024-11-09 13:41:40,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bae0f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:40, skipping insertion in model container [2024-11-09 13:41:40,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:40" (1/1) ... [2024-11-09 13:41:40,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:41:40,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:41:40,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:41:40,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:41:41,109 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:41:41,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41 WrapperNode [2024-11-09 13:41:41,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:41:41,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:41:41,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:41:41,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:41:41,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,188 INFO L138 Inliner]: procedures = 498, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2024-11-09 13:41:41,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:41:41,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:41:41,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:41:41,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:41:41,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,232 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:41:41,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:41:41,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:41:41,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:41:41,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:41:41,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (1/1) ... [2024-11-09 13:41:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:41:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:41:41,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 13:41:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 13:41:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:41:41,353 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:41:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:41:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:41:41,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:41:41,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:41:41,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:41:41,770 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-09 13:41:41,771 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:41:41,784 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:41:41,784 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:41:41,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:41 BoogieIcfgContainer [2024-11-09 13:41:41,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:41:41,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:41:41,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:41:41,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:41:41,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:41:40" (1/3) ... [2024-11-09 13:41:41,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f812646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:41, skipping insertion in model container [2024-11-09 13:41:41,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:41" (2/3) ... [2024-11-09 13:41:41,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f812646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:41, skipping insertion in model container [2024-11-09 13:41:41,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:41" (3/3) ... [2024-11-09 13:41:41,794 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:41,809 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:41:41,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:41:41,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:41:41,882 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;@ade290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:41:41,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:41:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 38 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 13:41:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 13:41:41,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:41:41,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:41:41,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:41:41,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:41:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1664946168, now seen corresponding path program 1 times [2024-11-09 13:41:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:41:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951056127] [2024-11-09 13:41:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:41:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:41:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:41:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:41:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:41:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 13:41:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:41:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951056127] [2024-11-09 13:41:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951056127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:41:42,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:41:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:41:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692485457] [2024-11-09 13:41:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:41:42,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:41:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:41:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:41:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:41:42,421 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 38 states have internal predecessors, (52), 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.5) internal successors, (13), 3 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-11-09 13:41:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:41:42,454 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-09 13:41:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:41:42,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-11-09 13:41:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:41:42,464 INFO L225 Difference]: With dead ends: 42 [2024-11-09 13:41:42,465 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 13:41:42,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:41:42,473 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:41:42,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:41:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 13:41:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 13:41:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-11-09 13:41:42,513 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 15 [2024-11-09 13:41:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:41:42,514 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-11-09 13:41:42,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-11-09 13:41:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 13:41:42,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:41:42,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:41:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 13:41:42,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:41:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:41:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 73723781, now seen corresponding path program 1 times [2024-11-09 13:41:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:41:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823335188] [2024-11-09 13:41:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:41:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:41:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:41:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:41:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:41:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 13:41:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:41:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823335188] [2024-11-09 13:41:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823335188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:41:42,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:41:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 13:41:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591094544] [2024-11-09 13:41:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:41:42,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 13:41:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:41:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 13:41:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 13:41:42,779 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:41:42,844 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-09 13:41:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 13:41:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2024-11-09 13:41:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:41:42,847 INFO L225 Difference]: With dead ends: 38 [2024-11-09 13:41:42,847 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 13:41:42,847 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-11-09 13:41:42,849 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 13:41:42,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 178 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 13:41:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 13:41:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 13:41:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-09 13:41:42,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2024-11-09 13:41:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:41:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-09 13:41:42,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-09 13:41:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 13:41:42,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:41:42,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:41:42,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 13:41:42,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:41:42,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:41:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2076872683, now seen corresponding path program 1 times [2024-11-09 13:41:42,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:41:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812306400] [2024-11-09 13:41:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:41:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:41:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:41:42,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:41:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:41:42,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:41:42,930 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:41:42,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:41:42,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:41:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:41:42,938 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:41:42,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:41:42,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:41:42 BoogieIcfgContainer [2024-11-09 13:41:42,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:41:42,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:41:42,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:41:42,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:41:42,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:41" (3/4) ... [2024-11-09 13:41:42,976 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:41:42,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:41:42,978 INFO L158 Benchmark]: Toolchain (without parser) took 2899.20ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 125.1MB in the beginning and 93.6MB in the end (delta: 31.5MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,978 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 161.5MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:41:42,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1031.33ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 116.1MB in the end (delta: 9.0MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.40ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 112.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,979 INFO L158 Benchmark]: Boogie Preprocessor took 64.67ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,979 INFO L158 Benchmark]: RCFGBuilder took 526.95ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 110.8MB in the beginning and 170.1MB in the end (delta: -59.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,980 INFO L158 Benchmark]: TraceAbstraction took 1184.75ms. Allocated memory is still 216.0MB. Free memory was 169.1MB in the beginning and 94.6MB in the end (delta: 74.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,980 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 216.0MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:41:42,982 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.44ms. Allocated memory is still 161.5MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1031.33ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 116.1MB in the end (delta: 9.0MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.40ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 112.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.67ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 526.95ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 110.8MB in the beginning and 170.1MB in the end (delta: -59.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1184.75ms. Allocated memory is still 216.0MB. Free memory was 169.1MB in the beginning and 94.6MB in the end (delta: 74.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 216.0MB. Free memory was 94.6MB in the beginning and 93.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1571. 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); [L1548] static int CWE190_Integer_Overflow__int_rand_postinc_45_badData; [L1549] static int CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData; [L1550] static int CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData; VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, 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) [L1571] RET printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1572] CALL CWE190_Integer_Overflow__int_rand_postinc_45_bad() [L1562] int data; [L1563] data = 0 [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1564] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1565] CWE190_Integer_Overflow__int_rand_postinc_45_badData = data [L1566] CALL badSink() [L1553] int data = CWE190_Integer_Overflow__int_rand_postinc_45_badData; [L1555] data++ VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=2147483647, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 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, 280 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 89 mSDtfsCounter, 52 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=42occurred 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, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 13:41:43,012 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_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 142c16f836549b8d04d87269f1e0aca006cd15d05060605c5152feadc89b66b7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:41:45,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:41:45,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:41:45,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:41:45,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:41:45,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:41:45,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:41:45,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:41:45,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:41:45,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:41:45,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:41:45,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:41:45,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:41:45,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:41:45,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:41:45,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:41:45,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:41:45,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:41:45,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:41:45,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:41:45,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:41:45,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:41:45,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:41:45,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:41:45,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:41:45,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:41:45,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:41:45,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:41:45,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:41:45,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:41:45,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:41:45,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:41:45,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:41:45,357 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:41:45,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:41:45,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:41:45,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:41:45,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:41:45,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:41:45,362 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 -> 142c16f836549b8d04d87269f1e0aca006cd15d05060605c5152feadc89b66b7 [2024-11-09 13:41:45,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:41:45,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:41:45,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:41:45,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:41:45,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:41:45,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:47,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:41:47,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:41:47,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:47,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427187398/e1425ae1ac154c06af3260cf388a6a9b/FLAGccf25d544 [2024-11-09 13:41:47,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427187398/e1425ae1ac154c06af3260cf388a6a9b [2024-11-09 13:41:47,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:41:47,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:41:47,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:41:47,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:41:47,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:41:47,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:47" (1/1) ... [2024-11-09 13:41:47,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a83bcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:47, skipping insertion in model container [2024-11-09 13:41:47,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:47" (1/1) ... [2024-11-09 13:41:47,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:41:48,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:41:48,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:41:48,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:41:48,696 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:41:48,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48 WrapperNode [2024-11-09 13:41:48,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:41:48,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:41:48,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:41:48,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:41:48,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,762 INFO L138 Inliner]: procedures = 503, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2024-11-09 13:41:48,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:41:48,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:41:48,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:41:48,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:41:48,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,792 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:41:48,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:41:48,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:41:48,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:41:48,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:41:48,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (1/1) ... [2024-11-09 13:41:48,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:41:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:41:48,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 13:41:48,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 13:41:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:41:48,928 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:41:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:41:48,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:41:48,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:41:49,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:41:49,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:41:49,261 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-09 13:41:49,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:41:49,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:41:49,276 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:41:49,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:49 BoogieIcfgContainer [2024-11-09 13:41:49,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:41:49,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:41:49,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:41:49,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:41:49,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:41:47" (1/3) ... [2024-11-09 13:41:49,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ed7adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:49, skipping insertion in model container [2024-11-09 13:41:49,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:48" (2/3) ... [2024-11-09 13:41:49,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ed7adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:49, skipping insertion in model container [2024-11-09 13:41:49,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:49" (3/3) ... [2024-11-09 13:41:49,288 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_45_bad.i [2024-11-09 13:41:49,303 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:41:49,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:41:49,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:41:49,389 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;@5b48e830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:41:49,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:41:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 13:41:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 13:41:49,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:41:49,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:41:49,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:41:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:41:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 733378214, now seen corresponding path program 1 times [2024-11-09 13:41:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:41:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953359262] [2024-11-09 13:41:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:41:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:41:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:41:49,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 13:41:49,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 13:41:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:41:49,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 13:41:49,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:41:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 13:41:49,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:41:49,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:41:49,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953359262] [2024-11-09 13:41:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953359262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:41:49,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:41:49,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 13:41:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411803158] [2024-11-09 13:41:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:41:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 13:41:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:41:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 13:41:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:41:49,610 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 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 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:41:49,624 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-09 13:41:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 13:41:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 13:41:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:41:49,632 INFO L225 Difference]: With dead ends: 22 [2024-11-09 13:41:49,632 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 13:41:49,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-11-09 13:41:49,637 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:41:49,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:41:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 13:41:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 13:41:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-09 13:41:49,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-09 13:41:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:41:49,671 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-09 13:41:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:41:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-09 13:41:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:41:49,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:41:49,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:41:49,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 13:41:49,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:41:49,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:41:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:41:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1259888207, now seen corresponding path program 1 times [2024-11-09 13:41:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:41:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731465013] [2024-11-09 13:41:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:41:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:41:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:41:49,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 13:41:49,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 13:41:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:41:49,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:41:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:41:50,021 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:41:50,022 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:41:50,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:41:50,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:41:50,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 13:41:50,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 13:41:50,230 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 13:41:50,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:41:50,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:41:50 BoogieIcfgContainer [2024-11-09 13:41:50,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:41:50,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:41:50,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:41:50,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:41:50,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:49" (3/4) ... [2024-11-09 13:41:50,264 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:41:50,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:41:50,267 INFO L158 Benchmark]: Toolchain (without parser) took 2627.36ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 33.4MB in the beginning and 28.7MB in the end (delta: 4.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,267 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:41:50,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1056.43ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 33.0MB in the beginning and 55.1MB in the end (delta: -22.0MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.15ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 51.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,269 INFO L158 Benchmark]: Boogie Preprocessor took 65.05ms. Allocated memory is still 86.0MB. Free memory was 51.9MB in the beginning and 49.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,270 INFO L158 Benchmark]: RCFGBuilder took 447.80ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 35.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,270 INFO L158 Benchmark]: TraceAbstraction took 978.58ms. Allocated memory is still 86.0MB. Free memory was 34.2MB in the beginning and 29.3MB in the end (delta: 5.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-09 13:41:50,271 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 86.0MB. Free memory was 29.3MB in the beginning and 28.7MB in the end (delta: 518.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:41:50,273 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.00ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1056.43ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 33.0MB in the beginning and 55.1MB in the end (delta: -22.0MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.15ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 51.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.05ms. Allocated memory is still 86.0MB. Free memory was 51.9MB in the beginning and 49.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.80ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 35.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 978.58ms. Allocated memory is still 86.0MB. Free memory was 34.2MB in the beginning and 29.3MB in the end (delta: 5.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 86.0MB. Free memory was 29.3MB in the beginning and 28.7MB in the end (delta: 518.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1571. 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); [L1548] static int CWE190_Integer_Overflow__int_rand_postinc_45_badData; [L1549] static int CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData; [L1550] static int CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData; VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, 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) [L1571] RET printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1572] CALL CWE190_Integer_Overflow__int_rand_postinc_45_bad() [L1562] int data; [L1563] data = 0 [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1565] CWE190_Integer_Overflow__int_rand_postinc_45_badData = data [L1566] CALL badSink() [L1553] int data = CWE190_Integer_Overflow__int_rand_postinc_45_badData; [L1555] data++ VAL [CWE190_Integer_Overflow__int_rand_postinc_45_badData=2147483647, CWE190_Integer_Overflow__int_rand_postinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_postinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 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, 23 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 52 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-11-09 13:41:50,318 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