./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_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 b7fd9943a1d2dd13f5be564f419263bb665288a6328abdee0f7a73021950a70e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:40,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:40,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 22:05:40,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:40,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:40,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:40,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:40,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:40,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:40,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:40,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:40,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:40,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:40,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:40,881 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:40,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:40,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:40,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 22:05:40,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:40,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:40,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:40,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:40,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:40,883 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:40,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:40,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:40,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:40,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:40,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:40,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:40,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:40,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:40,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:40,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:40,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:40,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 22:05:40,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 22:05:40,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:40,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:40,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:40,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:40,890 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 -> b7fd9943a1d2dd13f5be564f419263bb665288a6328abdee0f7a73021950a70e [2024-10-24 22:05:41,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:41,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:41,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:41,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:41,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:41,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:42,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:42,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:42,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:42,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8ade0c1/a276eff6ac8f4384a046a72c52bcfb1b/FLAG42db31cb5 [2024-10-24 22:05:43,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8ade0c1/a276eff6ac8f4384a046a72c52bcfb1b [2024-10-24 22:05:43,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:43,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:43,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:43,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:43,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:43,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2dbfdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43, skipping insertion in model container [2024-10-24 22:05:43,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:43,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:43,691 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:43,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:43,824 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43 WrapperNode [2024-10-24 22:05:43,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:43,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:43,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:43,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:43,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,885 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-10-24 22:05:43,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:43,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:43,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:43,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:43,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,914 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-24 22:05:43,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:43,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:43,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:43,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:43,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (1/1) ... [2024-10-24 22:05:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:43,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 22:05:43,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 22:05:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:44,009 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 22:05:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 22:05:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 22:05:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 22:05:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 22:05:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 22:05:44,125 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:44,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:44,317 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:44,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:44,357 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:44,357 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:05:44,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:44 BoogieIcfgContainer [2024-10-24 22:05:44,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:44,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:44,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:44,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:44,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:43" (1/3) ... [2024-10-24 22:05:44,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dcd2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:44, skipping insertion in model container [2024-10-24 22:05:44,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:43" (2/3) ... [2024-10-24 22:05:44,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dcd2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:44, skipping insertion in model container [2024-10-24 22:05:44,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:44" (3/3) ... [2024-10-24 22:05:44,371 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:44,402 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:44,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:05:44,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:44,485 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;@2d5c44b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:44,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:05:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 22:05:44,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:44,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:44,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:44,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1505961622, now seen corresponding path program 1 times [2024-10-24 22:05:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420611543] [2024-10-24 22:05:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420611543] [2024-10-24 22:05:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420611543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:44,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203088700] [2024-10-24 22:05:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:44,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:44,924 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 34 states have internal predecessors, (49), 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-10-24 22:05:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:44,972 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2024-10-24 22:05:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:44,975 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-10-24 22:05:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:44,982 INFO L225 Difference]: With dead ends: 38 [2024-10-24 22:05:44,983 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 22:05:44,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:44,988 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:44,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 22:05:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 22:05:45,021 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-10-24 22:05:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-24 22:05:45,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 15 [2024-10-24 22:05:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:45,024 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-24 22:05:45,024 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-10-24 22:05:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-24 22:05:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:05:45,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:45,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:45,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 22:05:45,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:45,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 559830102, now seen corresponding path program 1 times [2024-10-24 22:05:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178846418] [2024-10-24 22:05:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178846418] [2024-10-24 22:05:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178846418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 22:05:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137082766] [2024-10-24 22:05:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:45,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 22:05:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 22:05:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 22:05:45,478 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-10-24 22:05:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:45,548 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-10-24 22:05:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 22:05:45,548 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-10-24 22:05:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:45,550 INFO L225 Difference]: With dead ends: 39 [2024-10-24 22:05:45,550 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 22:05:45,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 22:05:45,552 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:45,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 22:05:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 22:05:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 22:05:45,559 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-10-24 22:05:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-24 22:05:45,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2024-10-24 22:05:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:45,561 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-24 22:05:45,562 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-10-24 22:05:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-24 22:05:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:05:45,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:45,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:45,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 22:05:45,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1767063376, now seen corresponding path program 1 times [2024-10-24 22:05:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425738664] [2024-10-24 22:05:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:45,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:45,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 22:05:45,647 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:45,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:05:45,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:05:45,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 22:05:45,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 22:05:45,693 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:45,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:45 BoogieIcfgContainer [2024-10-24 22:05:45,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:45,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:45,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:45,700 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:45,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:44" (3/4) ... [2024-10-24 22:05:45,704 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:45,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:45,706 INFO L158 Benchmark]: Toolchain (without parser) took 2652.09ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 102.1MB in the beginning and 175.4MB in the end (delta: -73.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:45,706 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:45,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.02ms. Allocated memory is still 165.7MB. Free memory was 101.7MB in the beginning and 78.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:45,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.47ms. Allocated memory is still 165.7MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:45,710 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 165.7MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:45,710 INFO L158 Benchmark]: RCFGBuilder took 429.20ms. Allocated memory is still 165.7MB. Free memory was 71.7MB in the beginning and 52.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:45,712 INFO L158 Benchmark]: TraceAbstraction took 1335.57ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 52.0MB in the beginning and 176.4MB in the end (delta: -124.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 22:05:45,712 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 209.7MB. Free memory was 176.4MB in the beginning and 175.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:45,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.02ms. Allocated memory is still 165.7MB. Free memory was 101.7MB in the beginning and 78.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.47ms. Allocated memory is still 165.7MB. Free memory was 77.2MB in the beginning and 74.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 165.7MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 429.20ms. Allocated memory is still 165.7MB. Free memory was 71.7MB in the beginning and 52.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1335.57ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 52.0MB in the beginning and 176.4MB in the end (delta: -124.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 209.7MB. Free memory was 176.4MB in the beginning and 175.4MB in the end (delta: 1.0MB). 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: 1574]: 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 1565. 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); [L1565] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1565] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] CALL CWE190_Integer_Overflow__int_rand_multiply_67_bad() [L1555] int data; [L1556] CWE190_Integer_Overflow__int_rand_multiply_67_structType myStruct; [L1557] data = 0 [L1558] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1558] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, myStruct={5:0}] [L1558] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, myStruct={5:0}] [L1558] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, myStruct={5:0}] [L1558] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1559] myStruct.structFirst = data [L1560] CALL CWE190_Integer_Overflow__int_rand_multiply_67b_badSink(myStruct) [L1571] EXPR myStruct.structFirst [L1571] int data = myStruct.structFirst; [L1572] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1574]: 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, 38 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, 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, 265 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 83 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:05:45,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_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 b7fd9943a1d2dd13f5be564f419263bb665288a6328abdee0f7a73021950a70e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:47,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:47,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 22:05:47,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:47,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:47,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 22:05:47,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:47,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:47,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:47,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:47,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:47,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:47,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:47,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:47,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:47,891 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:47,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:47,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:47,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:47,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:47,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:47,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:47,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 22:05:47,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 22:05:47,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:47,898 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:47,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 22:05:47,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:47,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:47,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:47,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:47,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:47,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:47,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:47,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:47,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:47,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:47,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:47,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 22:05:47,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 22:05:47,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:47,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:47,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:47,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:47,902 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 22:05:47,902 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 -> b7fd9943a1d2dd13f5be564f419263bb665288a6328abdee0f7a73021950a70e [2024-10-24 22:05:48,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:48,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:48,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:48,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:48,204 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:48,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:49,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:50,001 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:50,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:50,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ac5fc5e/dc05d9e02abb492ea86d5b2b5f0b66dd/FLAGd1214cd1e [2024-10-24 22:05:50,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ac5fc5e/dc05d9e02abb492ea86d5b2b5f0b66dd [2024-10-24 22:05:50,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:50,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:50,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:50,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:50,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:50,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:50,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c7a0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50, skipping insertion in model container [2024-10-24 22:05:50,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:50,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:50,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:50,743 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:50,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:50,924 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:50,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50 WrapperNode [2024-10-24 22:05:50,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:50,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:50,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:50,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:50,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:50,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:50,988 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2024-10-24 22:05:50,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:50,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:50,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:50,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:51,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,033 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-24 22:05:51,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:51,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:51,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:51,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:51,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (1/1) ... [2024-10-24 22:05:51,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:51,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:51,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 22:05:51,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 22:05:51,159 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 22:05:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 22:05:51,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 22:05:51,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 22:05:51,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:51,301 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:51,477 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:51,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:51,511 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:51,511 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:05:51,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:51 BoogieIcfgContainer [2024-10-24 22:05:51,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:51,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:51,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:51,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:51,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:50" (1/3) ... [2024-10-24 22:05:51,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714b0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:51, skipping insertion in model container [2024-10-24 22:05:51,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:50" (2/3) ... [2024-10-24 22:05:51,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714b0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:51, skipping insertion in model container [2024-10-24 22:05:51,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:51" (3/3) ... [2024-10-24 22:05:51,519 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-10-24 22:05:51,533 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:51,533 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:05:51,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:51,590 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;@379c58be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:51,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:05:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 22:05:51,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:51,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:51,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1887104530, now seen corresponding path program 1 times [2024-10-24 22:05:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073858295] [2024-10-24 22:05:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:51,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:51,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:05:51,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 22:05:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:51,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:05:51,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:51,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:51,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:51,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073858295] [2024-10-24 22:05:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073858295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126114623] [2024-10-24 22:05:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:51,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:51,801 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:51,851 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-10-24 22:05:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 22:05:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:51,859 INFO L225 Difference]: With dead ends: 18 [2024-10-24 22:05:51,860 INFO L226 Difference]: Without dead ends: 13 [2024-10-24 22:05:51,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:51,867 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:51,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-24 22:05:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-24 22:05:51,905 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-10-24 22:05:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-24 22:05:51,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-10-24 22:05:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:51,907 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-24 22:05:51,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-24 22:05:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 22:05:51,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:51,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:51,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 22:05:52,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:52,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:52,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1629301770, now seen corresponding path program 1 times [2024-10-24 22:05:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157808041] [2024-10-24 22:05:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:52,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:52,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:52,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:05:52,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 22:05:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:52,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:52,289 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 22:05:52,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:52,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:05:52,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:05:52,306 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-10-24 22:05:52,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:52,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 22:05:52,520 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:52,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:52 BoogieIcfgContainer [2024-10-24 22:05:52,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:52,527 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:52,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:52,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:52,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:51" (3/4) ... [2024-10-24 22:05:52,530 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:52,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:52,533 INFO L158 Benchmark]: Toolchain (without parser) took 2468.70ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 50.0MB in the beginning and 84.4MB in the end (delta: -34.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,534 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 71.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:52,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 858.28ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 50.0MB in the beginning and 53.4MB in the end (delta: -3.4MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.03ms. Allocated memory is still 96.5MB. Free memory was 53.4MB in the beginning and 50.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,538 INFO L158 Benchmark]: Boogie Preprocessor took 72.99ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 47.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,538 INFO L158 Benchmark]: RCFGBuilder took 449.72ms. Allocated memory is still 96.5MB. Free memory was 47.1MB in the beginning and 59.0MB in the end (delta: -11.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,538 INFO L158 Benchmark]: TraceAbstraction took 1012.51ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.4MB in the beginning and 85.2MB in the end (delta: -26.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-24 22:05:52,539 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 84.4MB in the end (delta: 759.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:52,543 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.28ms. Allocated memory is still 71.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 858.28ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 50.0MB in the beginning and 53.4MB in the end (delta: -3.4MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.03ms. Allocated memory is still 96.5MB. Free memory was 53.4MB in the beginning and 50.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.99ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 47.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.72ms. Allocated memory is still 96.5MB. Free memory was 47.1MB in the beginning and 59.0MB in the end (delta: -11.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1012.51ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 58.4MB in the beginning and 85.2MB in the end (delta: -26.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 84.4MB in the end (delta: 759.2kB). 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: 1574]: 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 1565. 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); [L1565] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1565] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] CALL CWE190_Integer_Overflow__int_rand_multiply_67_bad() [L1555] int data; [L1556] CWE190_Integer_Overflow__int_rand_multiply_67_structType myStruct; [L1557] data = 0 [L1558] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1558] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, myStruct={5:0}] [L1558] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1559] myStruct.structFirst = data [L1560] CALL CWE190_Integer_Overflow__int_rand_multiply_67b_badSink(myStruct) [L1571] EXPR myStruct.structFirst [L1571] int data = myStruct.structFirst; [L1572] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1574] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1574]: 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, 18 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, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:05:52,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample