./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_34_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_add_34_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 c84804019f77a69b31f73bc1877658ed1bfa861a7e9dfa4f9fbb903d3ec6a037 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:32:44,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:32:45,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:32:45,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:32:45,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:32:45,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:32:45,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:32:45,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:32:45,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:32:45,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:32:45,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:32:45,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:32:45,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:32:45,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:32:45,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:32:45,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:32:45,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:32:45,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:32:45,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:32:45,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:32:45,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:32:45,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:32:45,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:32:45,110 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:32:45,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:32:45,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:32:45,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:32:45,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:32:45,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:32:45,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:32:45,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:32:45,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:32:45,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:32:45,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:32:45,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:32:45,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:32:45,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:32:45,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:32:45,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:32:45,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:32:45,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:32:45,115 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 -> c84804019f77a69b31f73bc1877658ed1bfa861a7e9dfa4f9fbb903d3ec6a037 [2024-11-19 12:32:45,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:32:45,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:32:45,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:32:45,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:32:45,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:32:45,423 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_add_34_bad.i [2024-11-19 12:32:46,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:32:47,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:32:47,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_34_bad.i [2024-11-19 12:32:47,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948ef3131/6cc73c17c5f44e95830833042a8f9c45/FLAGb3f2fdcb8 [2024-11-19 12:32:47,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948ef3131/6cc73c17c5f44e95830833042a8f9c45 [2024-11-19 12:32:47,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:32:47,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:32:47,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:32:47,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:32:47,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:32:47,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:47" (1/1) ... [2024-11-19 12:32:47,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b30756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:47, skipping insertion in model container [2024-11-19 12:32:47,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:47" (1/1) ... [2024-11-19 12:32:47,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:32:48,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:32:48,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:32:48,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:32:48,209 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:32:48,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48 WrapperNode [2024-11-19 12:32:48,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:32:48,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:32:48,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:32:48,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:32:48,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,271 INFO L138 Inliner]: procedures = 497, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-19 12:32:48,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:32:48,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:32:48,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:32:48,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:32:48,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,300 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-19 12:32:48,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:32:48,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:32:48,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:32:48,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:32:48,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (1/1) ... [2024-11-19 12:32:48,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:32:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:32:48,366 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-19 12:32:48,369 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-19 12:32:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:32:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:32:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 12:32:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 12:32:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:32:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:32:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:32:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 12:32:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 12:32:48,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:32:48,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:32:48,799 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-19 12:32:48,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:32:48,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:32:48,811 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:32:48,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:48 BoogieIcfgContainer [2024-11-19 12:32:48,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:32:48,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:32:48,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:32:48,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:32:48,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:32:47" (1/3) ... [2024-11-19 12:32:48,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438bcf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:48, skipping insertion in model container [2024-11-19 12:32:48,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:48" (2/3) ... [2024-11-19 12:32:48,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438bcf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:48, skipping insertion in model container [2024-11-19 12:32:48,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:48" (3/3) ... [2024-11-19 12:32:48,818 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_34_bad.i [2024-11-19 12:32:48,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:32:48,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:32:48,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:32:48,887 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;@2f0f8e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:32:48,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:32:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.457142857142857) internal successors, (51), 37 states have internal predecessors, (51), 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-19 12:32:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 12:32:48,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:32:48,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:32:48,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:32:48,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:32:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1571693812, now seen corresponding path program 1 times [2024-11-19 12:32:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:32:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351619441] [2024-11-19 12:32:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:32:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:32:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:32:49,503 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-19 12:32:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:32:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351619441] [2024-11-19 12:32:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351619441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:32:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:32:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 12:32:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438009023] [2024-11-19 12:32:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:32:49,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:32:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:32:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:32:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:32:49,540 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.457142857142857) internal successors, (51), 37 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:32:49,582 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-19 12:32:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:32:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 12:32:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:32:49,592 INFO L225 Difference]: With dead ends: 41 [2024-11-19 12:32:49,593 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 12:32:49,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 12:32:49,600 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 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-19 12:32:49,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:32:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 12:32:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 12:32:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-11-19 12:32:49,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 15 [2024-11-19 12:32:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:32:49,632 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-11-19 12:32:49,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-11-19 12:32:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 12:32:49,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:32:49,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:32:49,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 12:32:49,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:32:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:32:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1477868041, now seen corresponding path program 1 times [2024-11-19 12:32:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:32:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098262755] [2024-11-19 12:32:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:32:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:32:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:32:49,901 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-19 12:32:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:32:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098262755] [2024-11-19 12:32:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098262755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:32:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:32:49,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 12:32:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599938798] [2024-11-19 12:32:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:32:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 12:32:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:32:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 12:32:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 12:32:49,908 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:32:49,975 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-19 12:32:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 12:32:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 12:32:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:32:49,977 INFO L225 Difference]: With dead ends: 38 [2024-11-19 12:32:49,977 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 12:32:49,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-19 12:32:49,980 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 12:32:49,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 177 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 12:32:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 12:32:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 12:32:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-19 12:32:49,988 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2024-11-19 12:32:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:32:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-19 12:32:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-19 12:32:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 12:32:49,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:32:49,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:32:49,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 12:32:49,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:32:49,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:32:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -813950353, now seen corresponding path program 1 times [2024-11-19 12:32:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:32:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232522671] [2024-11-19 12:32:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:32:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:32:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:32:50,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:32:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:32:50,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 12:32:50,063 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:32:50,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:32:50,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:32:50,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 12:32:50,069 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 12:32:50,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:32:50,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:32:50 BoogieIcfgContainer [2024-11-19 12:32:50,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:32:50,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:32:50,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:32:50,102 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:32:50,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:48" (3/4) ... [2024-11-19 12:32:50,105 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:32:50,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:32:50,107 INFO L158 Benchmark]: Toolchain (without parser) took 2853.69ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 110.4MB in the beginning and 90.8MB in the end (delta: 19.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,107 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:32:50,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 954.19ms. Allocated memory is still 176.2MB. Free memory was 110.4MB in the beginning and 96.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.78ms. Allocated memory is still 176.2MB. Free memory was 96.2MB in the beginning and 92.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,112 INFO L158 Benchmark]: Boogie Preprocessor took 44.58ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,112 INFO L158 Benchmark]: RCFGBuilder took 493.57ms. Allocated memory is still 176.2MB. Free memory was 90.2MB in the beginning and 73.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,112 INFO L158 Benchmark]: TraceAbstraction took 1287.91ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 72.2MB in the beginning and 91.8MB in the end (delta: -19.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-19 12:32:50,113 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 211.8MB. Free memory was 91.8MB in the beginning and 90.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:32:50,114 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.23ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 954.19ms. Allocated memory is still 176.2MB. Free memory was 110.4MB in the beginning and 96.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.78ms. Allocated memory is still 176.2MB. Free memory was 96.2MB in the beginning and 92.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.58ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.57ms. Allocated memory is still 176.2MB. Free memory was 90.2MB in the beginning and 73.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1287.91ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 72.2MB in the beginning and 91.8MB in the end (delta: -19.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 211.8MB. Free memory was 91.8MB in the beginning and 90.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1571. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1571] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1572] CALL CWE190_Integer_Overflow__int_rand_add_34_bad() [L1555] int data; [L1556] CWE190_Integer_Overflow__int_rand_add_34_unionType myUnion; [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, myUnion={3: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, myUnion={3: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, myUnion={3:0}] [L1558] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1559] myUnion.unionFirst = data [L1561] EXPR myUnion.unionSecond [L1561] int data = myUnion.unionSecond; [L1563] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: 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, 41 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 88 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 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-19 12:32:50,149 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_add_34_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 c84804019f77a69b31f73bc1877658ed1bfa861a7e9dfa4f9fbb903d3ec6a037 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:32:52,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:32:52,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:32:52,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:32:52,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:32:52,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:32:52,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:32:52,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:32:52,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:32:52,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:32:52,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:32:52,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:32:52,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:32:52,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:32:52,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:32:52,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:32:52,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:32:52,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:32:52,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:32:52,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:32:52,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:32:52,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:32:52,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:32:52,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:32:52,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:32:52,417 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:32:52,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:32:52,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:32:52,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:32:52,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:32:52,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:32:52,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:32:52,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:32:52,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:32:52,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:32:52,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:32:52,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:32:52,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:32:52,421 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:32:52,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:32:52,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:32:52,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:32:52,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:32:52,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:32:52,423 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 -> c84804019f77a69b31f73bc1877658ed1bfa861a7e9dfa4f9fbb903d3ec6a037 [2024-11-19 12:32:52,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:32:52,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:32:52,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:32:52,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:32:52,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:32:52,785 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_add_34_bad.i [2024-11-19 12:32:54,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:32:54,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:32:54,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_34_bad.i [2024-11-19 12:32:54,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6248a22e1/c23cb997ff2546a7864f5dd7654f5afb/FLAG440412255 [2024-11-19 12:32:54,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6248a22e1/c23cb997ff2546a7864f5dd7654f5afb [2024-11-19 12:32:54,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:32:54,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:32:54,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:32:54,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:32:54,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:32:54,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:54" (1/1) ... [2024-11-19 12:32:54,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527a58b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:54, skipping insertion in model container [2024-11-19 12:32:54,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:54" (1/1) ... [2024-11-19 12:32:54,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:32:55,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:32:55,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:32:55,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:32:55,759 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:32:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55 WrapperNode [2024-11-19 12:32:55,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:32:55,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:32:55,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:32:55,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:32:55,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,828 INFO L138 Inliner]: procedures = 502, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-19 12:32:55,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:32:55,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:32:55,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:32:55,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:32:55,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-19 12:32:55,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:32:55,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:32:55,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:32:55,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:32:55,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (1/1) ... [2024-11-19 12:32:55,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:32:55,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:32:55,950 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-19 12:32:55,956 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-19 12:32:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:32:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:32:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 12:32:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 12:32:56,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:32:56,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:32:56,319 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-19 12:32:56,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:32:56,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:32:56,333 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:32:56,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:56 BoogieIcfgContainer [2024-11-19 12:32:56,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:32:56,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:32:56,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:32:56,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:32:56,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:32:54" (1/3) ... [2024-11-19 12:32:56,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e891d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:56, skipping insertion in model container [2024-11-19 12:32:56,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:55" (2/3) ... [2024-11-19 12:32:56,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e891d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:56, skipping insertion in model container [2024-11-19 12:32:56,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:56" (3/3) ... [2024-11-19 12:32:56,346 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_34_bad.i [2024-11-19 12:32:56,362 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:32:56,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:32:56,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:32:56,440 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;@2c9981d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:32:56,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:32:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-19 12:32:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 12:32:56,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:32:56,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:32:56,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:32:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:32:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash 51472802, now seen corresponding path program 1 times [2024-11-19 12:32:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:32:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443674619] [2024-11-19 12:32:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:32:56,473 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-19 12:32:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:32:56,474 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-19 12:32:56,475 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-19 12:32:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:32:56,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 12:32:56,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:32:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:32:56,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:32:56,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:32:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443674619] [2024-11-19 12:32:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443674619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:32:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:32:56,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 12:32:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709518812] [2024-11-19 12:32:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:32:56,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 12:32:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:32:56,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 12:32:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:32:56,696 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:32:56,711 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-19 12:32:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 12:32:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 12:32:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:32:56,720 INFO L225 Difference]: With dead ends: 21 [2024-11-19 12:32:56,721 INFO L226 Difference]: Without dead ends: 13 [2024-11-19 12:32:56,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:32:56,728 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:32:56,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:32:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-19 12:32:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 12:32:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-19 12:32:56,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-19 12:32:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:32:56,764 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-19 12:32:56,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:32:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-19 12:32:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:32:56,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:32:56,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:32:56,771 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-19 12:32:56,966 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-19 12:32:56,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:32:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:32:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1595656915, now seen corresponding path program 1 times [2024-11-19 12:32:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:32:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888370763] [2024-11-19 12:32:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:32:56,969 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-19 12:32:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:32:56,974 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-19 12:32:56,975 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-19 12:32:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:32:57,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:32:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:32:57,143 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 12:32:57,144 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:32:57,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:32:57,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:32:57,154 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-19 12:32:57,352 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-19 12:32:57,356 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 12:32:57,383 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:32:57,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:32:57 BoogieIcfgContainer [2024-11-19 12:32:57,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:32:57,389 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:32:57,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:32:57,389 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:32:57,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:56" (3/4) ... [2024-11-19 12:32:57,392 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:32:57,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:32:57,393 INFO L158 Benchmark]: Toolchain (without parser) took 2637.90ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 37.5MB in the beginning and 68.8MB in the end (delta: -31.3MB). Peak memory consumption was 575.2kB. Max. memory is 16.1GB. [2024-11-19 12:32:57,393 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 46.1MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:32:57,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1003.31ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.4MB in the beginning and 37.0MB in the end (delta: 342.5kB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-19 12:32:57,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.79ms. Allocated memory is still 81.8MB. Free memory was 37.0MB in the beginning and 33.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 12:32:57,395 INFO L158 Benchmark]: Boogie Preprocessor took 75.53ms. Allocated memory is still 81.8MB. Free memory was 33.7MB in the beginning and 53.3MB in the end (delta: -19.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-19 12:32:57,395 INFO L158 Benchmark]: RCFGBuilder took 428.35ms. Allocated memory is still 81.8MB. Free memory was 53.3MB in the beginning and 38.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 12:32:57,396 INFO L158 Benchmark]: TraceAbstraction took 1052.69ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 37.9MB in the beginning and 69.5MB in the end (delta: -31.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-19 12:32:57,396 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 100.7MB. Free memory was 69.5MB in the beginning and 68.8MB in the end (delta: 661.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:32:57,398 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 46.1MB. Free memory is still 22.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1003.31ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.4MB in the beginning and 37.0MB in the end (delta: 342.5kB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.79ms. Allocated memory is still 81.8MB. Free memory was 37.0MB in the beginning and 33.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.53ms. Allocated memory is still 81.8MB. Free memory was 33.7MB in the beginning and 53.3MB in the end (delta: -19.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 428.35ms. Allocated memory is still 81.8MB. Free memory was 53.3MB in the beginning and 38.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1052.69ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 37.9MB in the beginning and 69.5MB in the end (delta: -31.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 100.7MB. Free memory was 69.5MB in the beginning and 68.8MB in the end (delta: 661.3kB). 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: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1571. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1571] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1572] CALL CWE190_Integer_Overflow__int_rand_add_34_bad() [L1555] int data; [L1556] CWE190_Integer_Overflow__int_rand_add_34_unionType myUnion; [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, myUnion={3:0}] [L1558] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1559] myUnion.unionFirst = data [L1561] EXPR myUnion.unionSecond [L1561] int data = myUnion.unionSecond; [L1563] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: 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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 22 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:32:57,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample