./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:13:56,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:13:56,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 19:13:56,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:13:56,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:13:56,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:13:56,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:13:56,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:13:56,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:13:56,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:13:56,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:13:56,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:13:56,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:13:56,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:13:56,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:13:56,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:13:56,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:13:56,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 19:13:56,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:13:56,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:13:56,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:13:56,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:13:56,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:13:56,337 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:13:56,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:13:56,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:13:56,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:13:56,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:13:56,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:56,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:13:56,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 19:13:56,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 19:13:56,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:13:56,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:13:56,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:13:56,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:13:56,342 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-11-12 19:13:56,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:13:56,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:13:56,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:13:56,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:13:56,589 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:13:56,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:13:57,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:13:58,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:13:58,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:13:58,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f48aebbf/217b6b2cf33b4711bbd57054e6ee0d75/FLAGa383056cd [2024-11-12 19:13:58,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f48aebbf/217b6b2cf33b4711bbd57054e6ee0d75 [2024-11-12 19:13:58,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:13:58,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:13:58,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:58,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:13:58,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:13:58,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:58" (1/1) ... [2024-11-12 19:13:58,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4c6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:58, skipping insertion in model container [2024-11-12 19:13:58,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:58" (1/1) ... [2024-11-12 19:13:58,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:13:58,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:58,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:13:59,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:59,139 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:13:59,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59 WrapperNode [2024-11-12 19:13:59,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:59,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:59,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:13:59,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:13:59,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,217 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-12 19:13:59,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:59,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:13:59,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:13:59,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:13:59,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,239 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-11-12 19:13:59,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:13:59,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:13:59,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:13:59,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:13:59,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (1/1) ... [2024-11-12 19:13:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:13:59,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 19:13:59,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:13:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:13:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 19:13:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 19:13:59,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:13:59,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:13:59,619 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-12 19:13:59,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:13:59,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:13:59,629 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:13:59,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:59 BoogieIcfgContainer [2024-11-12 19:13:59,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:13:59,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:13:59,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:13:59,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:13:59,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:13:58" (1/3) ... [2024-11-12 19:13:59,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7508d69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:59, skipping insertion in model container [2024-11-12 19:13:59,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:59" (2/3) ... [2024-11-12 19:13:59,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7508d69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:59, skipping insertion in model container [2024-11-12 19:13:59,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:59" (3/3) ... [2024-11-12 19:13:59,636 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:13:59,647 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:13:59,647 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:13:59,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:13:59,693 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;@5f08d4b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:13:59,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:13:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 40 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:13:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 19:13:59,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:59,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:59,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:59,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash -545813801, now seen corresponding path program 1 times [2024-11-12 19:13:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234470193] [2024-11-12 19:13:59,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:14:00,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:14:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:14:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:14:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:14:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234470193] [2024-11-12 19:14:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234470193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:14:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:14:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:14:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020291130] [2024-11-12 19:14:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:14:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:14:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:14:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:14:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:14:00,056 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 40 states have internal predecessors, (55), 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 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:14:00,081 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2024-11-12 19:14:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:14:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-12 19:14:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:14:00,095 INFO L225 Difference]: With dead ends: 44 [2024-11-12 19:14:00,096 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 19:14:00,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:14:00,099 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:14:00,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:14:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 19:14:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 19:14:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-11-12 19:14:00,122 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2024-11-12 19:14:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:14:00,122 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-11-12 19:14:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-11-12 19:14:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 19:14:00,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:14:00,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:14:00,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 19:14:00,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:14:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:14:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash 259641481, now seen corresponding path program 1 times [2024-11-12 19:14:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:14:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379359744] [2024-11-12 19:14:00,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:14:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:14:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:14:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:14:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:14:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:14:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:14:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379359744] [2024-11-12 19:14:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379359744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:14:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:14:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 19:14:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353209223] [2024-11-12 19:14:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:14:00,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 19:14:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:14:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 19:14:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 19:14:00,521 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:14:00,574 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-12 19:14:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 19:14:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2024-11-12 19:14:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:14:00,576 INFO L225 Difference]: With dead ends: 40 [2024-11-12 19:14:00,577 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 19:14:00,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 19:14:00,579 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:14:00,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:14:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 19:14:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 19:14:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-12 19:14:00,585 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 17 [2024-11-12 19:14:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:14:00,586 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-12 19:14:00,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-12 19:14:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 19:14:00,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:14:00,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:14:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 19:14:00,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:14:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:14:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2067251997, now seen corresponding path program 1 times [2024-11-12 19:14:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:14:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702647304] [2024-11-12 19:14:00,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:14:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:14:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:14:00,624 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:14:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:14:00,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 19:14:00,664 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:14:00,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:14:00,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:14:00,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 19:14:00,670 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 19:14:00,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:14:00,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:14:00 BoogieIcfgContainer [2024-11-12 19:14:00,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:14:00,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:14:00,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:14:00,700 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:14:00,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:59" (3/4) ... [2024-11-12 19:14:00,702 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:14:00,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:14:00,705 INFO L158 Benchmark]: Toolchain (without parser) took 2345.60ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 111.6MB in the beginning and 105.9MB in the end (delta: 5.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,705 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:14:00,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 780.04ms. Allocated memory is still 144.7MB. Free memory was 111.6MB in the beginning and 45.7MB in the end (delta: 66.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.61ms. Allocated memory is still 144.7MB. Free memory was 45.7MB in the beginning and 112.6MB in the end (delta: -66.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,708 INFO L158 Benchmark]: Boogie Preprocessor took 32.11ms. Allocated memory is still 144.7MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,708 INFO L158 Benchmark]: RCFGBuilder took 378.51ms. Allocated memory is still 144.7MB. Free memory was 109.7MB in the beginning and 101.3MB in the end (delta: 8.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,709 INFO L158 Benchmark]: TraceAbstraction took 1067.62ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 100.1MB in the beginning and 106.9MB in the end (delta: -6.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-12 19:14:00,710 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 182.5MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:14:00,713 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.15ms. Allocated memory is still 144.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 780.04ms. Allocated memory is still 144.7MB. Free memory was 111.6MB in the beginning and 45.7MB in the end (delta: 66.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.61ms. Allocated memory is still 144.7MB. Free memory was 45.7MB in the beginning and 112.6MB in the end (delta: -66.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.11ms. Allocated memory is still 144.7MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.51ms. Allocated memory is still 144.7MB. Free memory was 109.7MB in the beginning and 101.3MB in the end (delta: 8.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1067.62ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 100.1MB in the beginning and 106.9MB in the end (delta: -6.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 182.5MB. Free memory is still 105.9MB. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [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, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 94 mSDtfsCounter, 51 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=44occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 19:14:00,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:14:02,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:14:02,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 19:14:02,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:14:02,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:14:02,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 19:14:02,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:14:02,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:14:02,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:14:02,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:14:02,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:14:02,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:14:02,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:14:02,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:14:02,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:14:02,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:14:02,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:14:02,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:14:02,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:14:02,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:14:02,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:14:02,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:14:02,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 19:14:02,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 19:14:02,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:14:02,606 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:14:02,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 19:14:02,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:14:02,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:14:02,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:14:02,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:14:02,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:14:02,607 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 19:14:02,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 19:14:02,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:14:02,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:14:02,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:14:02,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:14:02,610 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-11-12 19:14:02,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:14:02,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:14:02,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:14:02,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:14:02,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:14:02,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:14:04,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:14:04,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:14:04,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:14:04,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2e899e6/19e454207559470cbb2f7c8c4a2812f5/FLAGa43e6a867 [2024-11-12 19:14:04,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2e899e6/19e454207559470cbb2f7c8c4a2812f5 [2024-11-12 19:14:04,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:14:04,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:14:04,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:14:04,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:14:04,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:14:04,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:04" (1/1) ... [2024-11-12 19:14:04,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76caebd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:04, skipping insertion in model container [2024-11-12 19:14:04,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:04" (1/1) ... [2024-11-12 19:14:04,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:14:05,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:14:05,067 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:14:05,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:14:05,274 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:14:05,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05 WrapperNode [2024-11-12 19:14:05,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:14:05,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:14:05,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:14:05,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:14:05,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,315 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2024-11-12 19:14:05,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:14:05,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:14:05,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:14:05,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:14:05,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,346 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-11-12 19:14:05,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:14:05,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:14:05,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:14:05,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:14:05,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (1/1) ... [2024-11-12 19:14:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:14:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:14:05,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 19:14:05,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:14:05,425 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:14:05,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 19:14:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 19:14:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 19:14:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 19:14:05,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:14:05,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:14:05,717 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-12 19:14:05,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:14:05,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:14:05,728 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:14:05,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:05 BoogieIcfgContainer [2024-11-12 19:14:05,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:14:05,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:14:05,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:14:05,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:14:05,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:14:04" (1/3) ... [2024-11-12 19:14:05,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d2ed63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:05, skipping insertion in model container [2024-11-12 19:14:05,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:05" (2/3) ... [2024-11-12 19:14:05,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d2ed63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:05, skipping insertion in model container [2024-11-12 19:14:05,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:05" (3/3) ... [2024-11-12 19:14:05,737 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_67_bad.i [2024-11-12 19:14:05,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:14:05,750 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:14:05,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:14:05,810 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;@2712c318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:14:05,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:14:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:14:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 19:14:05,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:14:05,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:14:05,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:14:05,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:14:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 84697761, now seen corresponding path program 1 times [2024-11-12 19:14:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:14:05,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507271038] [2024-11-12 19:14:05,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:14:05,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:14:05,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:14:05,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:14:05,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 19:14:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:14:05,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:14:05,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:14:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:14:05,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:14:05,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:14:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507271038] [2024-11-12 19:14:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507271038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:14:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:14:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:14:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159717162] [2024-11-12 19:14:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:14:05,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:14:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:14:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:14:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:14:06,018 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:14:06,072 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-12 19:14:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:14:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 19:14:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:14:06,080 INFO L225 Difference]: With dead ends: 24 [2024-11-12 19:14:06,080 INFO L226 Difference]: Without dead ends: 14 [2024-11-12 19:14:06,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:14:06,086 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:14:06,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:14:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-12 19:14:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-12 19:14:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-12 19:14:06,111 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2024-11-12 19:14:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:14:06,111 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-12 19:14:06,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:14:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-12 19:14:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 19:14:06,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:14:06,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:14:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 19:14:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:14:06,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:14:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:14:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1669336649, now seen corresponding path program 1 times [2024-11-12 19:14:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:14:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184061714] [2024-11-12 19:14:06,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:14:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:14:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:14:06,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:14:06,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 19:14:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:14:06,406 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:14:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:14:06,466 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 19:14:06,467 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:14:06,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:14:06,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:14:06,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 19:14:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:14:06,676 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 19:14:06,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:14:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:14:06 BoogieIcfgContainer [2024-11-12 19:14:06,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:14:06,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:14:06,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:14:06,711 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:14:06,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:05" (3/4) ... [2024-11-12 19:14:06,714 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:14:06,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:14:06,715 INFO L158 Benchmark]: Toolchain (without parser) took 2235.44ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 37.2MB in the beginning and 63.4MB in the end (delta: -26.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,715 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 39.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:14:06,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 792.96ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 42.1MB in the end (delta: -5.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.79ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 38.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,717 INFO L158 Benchmark]: Boogie Preprocessor took 44.51ms. Allocated memory is still 77.6MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,718 INFO L158 Benchmark]: RCFGBuilder took 364.70ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 43.8MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,718 INFO L158 Benchmark]: TraceAbstraction took 979.43ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.1MB in the beginning and 63.4MB in the end (delta: -20.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-12 19:14:06,718 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 94.4MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:14:06,721 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.76ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 39.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 792.96ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 42.1MB in the end (delta: -5.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.79ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 38.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.51ms. Allocated memory is still 77.6MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 364.70ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 43.8MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 979.43ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.1MB in the beginning and 63.4MB in the end (delta: -20.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 94.4MB. Free memory is still 63.4MB. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [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, 24 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, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 13 SizeOfPredicates, 0 NumberOfNonLiveVariables, 84 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-11-12 19:14:06,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample