./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_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 ca4d8713e04670e323fedc399b34cfedc7eb2f7b6fbc3f98a477f4aa5b20129c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:11,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:11,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 22:05:11,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:11,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:11,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:11,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:11,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:11,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:11,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:11,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:11,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:11,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:11,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:11,151 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:11,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:11,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:11,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 22:05:11,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:11,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:11,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:11,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:11,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:11,156 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:11,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:11,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:11,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:11,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:11,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:11,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:11,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:11,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:11,160 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 -> ca4d8713e04670e323fedc399b34cfedc7eb2f7b6fbc3f98a477f4aa5b20129c [2024-10-24 22:05:11,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:11,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:11,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:11,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:11,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:11,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:12,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:12,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:12,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:12,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675041975/df62453e160a4062a1dac07ad9d965f3/FLAGd67bb36ed [2024-10-24 22:05:13,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675041975/df62453e160a4062a1dac07ad9d965f3 [2024-10-24 22:05:13,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:13,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:13,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:13,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:13,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:13,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:13,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340e4cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13, skipping insertion in model container [2024-10-24 22:05:13,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:13,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:13,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:13,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:13,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:13,977 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:13,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13 WrapperNode [2024-10-24 22:05:13,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:13,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:13,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:13,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:13,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,033 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-10-24 22:05:14,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:14,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:14,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:14,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:14,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,067 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:05:14,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:14,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:14,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:14,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:14,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (1/1) ... [2024-10-24 22:05:14,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:14,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:14,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 22:05:14,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 22:05:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:14,296 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:14,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:14,485 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:14,485 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:14,511 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:14,511 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:05:14,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:14 BoogieIcfgContainer [2024-10-24 22:05:14,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:14,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:14,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:14,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:14,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:13" (1/3) ... [2024-10-24 22:05:14,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1cf90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:14, skipping insertion in model container [2024-10-24 22:05:14,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:13" (2/3) ... [2024-10-24 22:05:14,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1cf90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:14, skipping insertion in model container [2024-10-24 22:05:14,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:14" (3/3) ... [2024-10-24 22:05:14,517 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:14,528 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:14,529 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:05:14,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:14,579 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;@3913e8a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:14,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:05:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 22:05:14,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:14,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:14,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:14,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1178046316, now seen corresponding path program 1 times [2024-10-24 22:05:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095970587] [2024-10-24 22:05:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095970587] [2024-10-24 22:05:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095970587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060360180] [2024-10-24 22:05:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:14,895 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.53125) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:14,930 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2024-10-24 22:05:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 22:05:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:14,937 INFO L225 Difference]: With dead ends: 38 [2024-10-24 22:05:14,937 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 22:05:14,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:14,942 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:14,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 22:05:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 22:05:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-24 22:05:14,966 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 15 [2024-10-24 22:05:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:14,966 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-24 22:05:14,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-24 22:05:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:05:14,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:14,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 22:05:14,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2135269740, now seen corresponding path program 1 times [2024-10-24 22:05:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679937353] [2024-10-24 22:05:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:15,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679937353] [2024-10-24 22:05:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679937353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 22:05:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324983864] [2024-10-24 22:05:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:15,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 22:05:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 22:05:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 22:05:15,216 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:15,262 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-10-24 22:05:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 22:05:15,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 22:05:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:15,263 INFO L225 Difference]: With dead ends: 39 [2024-10-24 22:05:15,264 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 22:05:15,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 22:05:15,265 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:15,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 175 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 22:05:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 22:05:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-24 22:05:15,270 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2024-10-24 22:05:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:15,270 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-24 22:05:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-24 22:05:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:05:15,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:15,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:15,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 22:05:15,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:15,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -167195922, now seen corresponding path program 1 times [2024-10-24 22:05:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300797988] [2024-10-24 22:05:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:15,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:15,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 22:05:15,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:15,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:05:15,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:05:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 22:05:15,319 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 22:05:15,334 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:15,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:15 BoogieIcfgContainer [2024-10-24 22:05:15,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:15,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:15,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:15,339 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:15,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:14" (3/4) ... [2024-10-24 22:05:15,341 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:15,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:15,342 INFO L158 Benchmark]: Toolchain (without parser) took 2200.47ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 68.3MB in the beginning and 119.9MB in the end (delta: -51.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-10-24 22:05:15,342 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:15,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.69ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 68.0MB in the beginning and 117.8MB in the end (delta: -49.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:15,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.06ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:15,343 INFO L158 Benchmark]: Boogie Preprocessor took 47.35ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:15,344 INFO L158 Benchmark]: RCFGBuilder took 427.27ms. Allocated memory is still 201.3MB. Free memory was 111.6MB in the beginning and 93.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:15,344 INFO L158 Benchmark]: TraceAbstraction took 825.43ms. Allocated memory is still 201.3MB. Free memory was 92.7MB in the beginning and 119.9MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:15,345 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:15,346 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.14ms. Allocated memory is still 142.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 835.69ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 68.0MB in the beginning and 117.8MB in the end (delta: -49.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.06ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.35ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.27ms. Allocated memory is still 201.3MB. Free memory was 111.6MB in the beginning and 93.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 825.43ms. Allocated memory is still 201.3MB. Free memory was 92.7MB in the beginning and 119.9MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1566. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1566] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1566] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL CWE190_Integer_Overflow__int_rand_multiply_31_bad() [L1550] int data; [L1551] data = 0 [L1552] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1552] 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] [L1552] 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] [L1552] 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] [L1552] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1554] int dataCopy = data; [L1555] int data = dataCopy; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 83 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:05:15,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_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 ca4d8713e04670e323fedc399b34cfedc7eb2f7b6fbc3f98a477f4aa5b20129c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:17,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:17,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 22:05:17,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:17,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:17,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 22:05:17,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:17,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:17,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:17,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:17,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:17,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:17,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:17,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:17,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:17,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:17,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:17,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:17,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:17,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:17,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:17,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:17,270 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 22:05:17,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 22:05:17,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:17,271 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:17,271 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 22:05:17,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:17,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:17,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:17,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:17,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:17,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:17,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:17,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:17,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:17,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:17,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:17,284 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 22:05:17,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 22:05:17,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:17,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:17,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:17,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:17,285 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 22:05:17,286 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 -> ca4d8713e04670e323fedc399b34cfedc7eb2f7b6fbc3f98a477f4aa5b20129c [2024-10-24 22:05:17,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:17,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:17,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:17,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:17,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:17,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:18,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:19,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:19,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:19,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbfc3f05e/aab2c0024df4497395b2a5d52f2294ab/FLAG710e22cdf [2024-10-24 22:05:19,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbfc3f05e/aab2c0024df4497395b2a5d52f2294ab [2024-10-24 22:05:19,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:19,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:19,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:19,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:19,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:19,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9fb93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19, skipping insertion in model container [2024-10-24 22:05:19,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:19,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:19,751 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:19,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:19,919 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:19,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19 WrapperNode [2024-10-24 22:05:19,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:19,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:19,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:19,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:19,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,967 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-10-24 22:05:19,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:19,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:19,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:19,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:19,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,985 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:05:19,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:20,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:20,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:20,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:20,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:20,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:20,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 22:05:20,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 22:05:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:20,072 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:20,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:20,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:20,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:20,326 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:20,326 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:20,357 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:20,358 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:05:20,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:20 BoogieIcfgContainer [2024-10-24 22:05:20,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:20,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:20,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:20,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:20,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:19" (1/3) ... [2024-10-24 22:05:20,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d3a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:20, skipping insertion in model container [2024-10-24 22:05:20,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (2/3) ... [2024-10-24 22:05:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d3a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:20, skipping insertion in model container [2024-10-24 22:05:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:20" (3/3) ... [2024-10-24 22:05:20,366 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_31_bad.i [2024-10-24 22:05:20,378 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:20,378 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:05:20,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:20,432 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;@7d11680a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:20,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:05:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 22:05:20,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:20,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:20,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1341502318, now seen corresponding path program 1 times [2024-10-24 22:05:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88582381] [2024-10-24 22:05:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:20,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:20,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:05:20,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 22:05:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:20,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:05:20,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:20,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:20,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88582381] [2024-10-24 22:05:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88582381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:20,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:20,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615031707] [2024-10-24 22:05:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:20,616 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:20,645 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-10-24 22:05:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 22:05:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:20,660 INFO L225 Difference]: With dead ends: 18 [2024-10-24 22:05:20,660 INFO L226 Difference]: Without dead ends: 13 [2024-10-24 22:05:20,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:20,666 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:20,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-24 22:05:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-24 22:05:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-24 22:05:20,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-10-24 22:05:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:20,694 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-24 22:05:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-24 22:05:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 22:05:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:20,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:20,699 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-10-24 22:05:20,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:20,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:05:20,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1363101046, now seen corresponding path program 1 times [2024-10-24 22:05:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406893851] [2024-10-24 22:05:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:20,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:05:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 22:05:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:20,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:21,005 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 22:05:21,006 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:21,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:05:21,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:05:21,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 22:05:21,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:05:21,212 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 22:05:21,247 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:21,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:21 BoogieIcfgContainer [2024-10-24 22:05:21,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:21,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:21,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:21,254 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:21,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:20" (3/4) ... [2024-10-24 22:05:21,256 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:21,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:21,267 INFO L158 Benchmark]: Toolchain (without parser) took 2093.87ms. Allocated memory was 67.1MB in the beginning and 127.9MB in the end (delta: 60.8MB). Free memory was 45.4MB in the beginning and 98.5MB in the end (delta: -53.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,268 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:21,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.73ms. Allocated memory was 67.1MB in the beginning and 102.8MB in the end (delta: 35.7MB). Free memory was 45.2MB in the beginning and 60.8MB in the end (delta: -15.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 102.8MB. Free memory was 60.8MB in the beginning and 57.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,279 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 102.8MB. Free memory was 57.6MB in the beginning and 55.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,283 INFO L158 Benchmark]: RCFGBuilder took 354.32ms. Allocated memory is still 102.8MB. Free memory was 55.0MB in the beginning and 69.7MB in the end (delta: -14.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,283 INFO L158 Benchmark]: TraceAbstraction took 893.66ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 69.1MB in the beginning and 98.5MB in the end (delta: -29.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-24 22:05:21,283 INFO L158 Benchmark]: Witness Printer took 8.73ms. Allocated memory is still 127.9MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:21,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 749.73ms. Allocated memory was 67.1MB in the beginning and 102.8MB in the end (delta: 35.7MB). Free memory was 45.2MB in the beginning and 60.8MB in the end (delta: -15.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 102.8MB. Free memory was 60.8MB in the beginning and 57.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 102.8MB. Free memory was 57.6MB in the beginning and 55.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.32ms. Allocated memory is still 102.8MB. Free memory was 55.0MB in the beginning and 69.7MB in the end (delta: -14.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 893.66ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 69.1MB in the beginning and 98.5MB in the end (delta: -29.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 8.73ms. Allocated memory is still 127.9MB. Free memory is still 98.5MB. 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: 1558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1566. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1566] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1566] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL CWE190_Integer_Overflow__int_rand_multiply_31_bad() [L1550] int data; [L1551] data = 0 [L1552] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1552] 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] [L1552] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1554] int dataCopy = data; [L1555] int data = dataCopy; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1558] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:05:21,319 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