./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_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 d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:33:20,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:33:20,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:33:20,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:33:20,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:33:20,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:33:20,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:33:20,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:33:20,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:33:20,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:33:20,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:33:20,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:33:20,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:33:20,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:33:20,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:33:20,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:33:20,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:33:20,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:33:20,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:33:20,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:33:20,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:33:20,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:33:20,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:33:20,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:33:20,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:33:20,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:33:20,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:33:20,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:33:20,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:33:20,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:33:20,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:33:20,296 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 -> d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 [2024-11-19 12:33:20,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:33:20,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:33:20,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:33:20,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:33:20,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:33:20,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:21,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:33:22,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:33:22,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:22,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0339b6d/da3c44f45b21455c80dbe2b7dcfe0f16/FLAG4531dba15 [2024-11-19 12:33:22,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0339b6d/da3c44f45b21455c80dbe2b7dcfe0f16 [2024-11-19 12:33:22,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:33:22,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:33:22,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:33:22,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:33:22,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:33:22,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:22" (1/1) ... [2024-11-19 12:33:22,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecf2c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22, skipping insertion in model container [2024-11-19 12:33:22,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:22" (1/1) ... [2024-11-19 12:33:22,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:33:22,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:33:22,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:33:22,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:33:23,073 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:33:23,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23 WrapperNode [2024-11-19 12:33:23,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:33:23,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:33:23,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:33:23,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:33:23,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,132 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-19 12:33:23,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:33:23,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:33:23,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:33:23,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:33:23,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,157 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:33:23,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:33:23,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:33:23,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:33:23,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:33:23,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (1/1) ... [2024-11-19 12:33:23,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:33:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:33:23,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 12:33:23,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 12:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:33:23,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:33:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:33:23,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:33:23,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:33:23,561 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-19 12:33:23,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:33:23,574 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:33:23,574 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:33:23,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:23 BoogieIcfgContainer [2024-11-19 12:33:23,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:33:23,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:33:23,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:33:23,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:33:23,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:33:22" (1/3) ... [2024-11-19 12:33:23,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92d87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:23, skipping insertion in model container [2024-11-19 12:33:23,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:23" (2/3) ... [2024-11-19 12:33:23,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92d87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:23, skipping insertion in model container [2024-11-19 12:33:23,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:23" (3/3) ... [2024-11-19 12:33:23,585 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:23,599 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:33:23,600 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:33:23,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:33:23,655 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;@3f1aaa65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:33:23,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:33:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5) internal successors, (57), 40 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 12:33:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:33:23,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:23,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:23,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:23,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash -458714749, now seen corresponding path program 1 times [2024-11-19 12:33:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:33:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072131264] [2024-11-19 12:33:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:33:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:33:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:33:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:33:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072131264] [2024-11-19 12:33:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072131264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:33:23,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:33:23,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:33:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633719894] [2024-11-19 12:33:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:33:23,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:33:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:33:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:33:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:23,924 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5) internal successors, (57), 40 states have internal predecessors, (57), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:33:23,950 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-19 12:33:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:33:23,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 12:33:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:33:23,978 INFO L225 Difference]: With dead ends: 61 [2024-11-19 12:33:23,978 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 12:33:23,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:23,987 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:33:23,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:33:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 12:33:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 12:33:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-19 12:33:24,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 12 [2024-11-19 12:33:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:33:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-19 12:33:24,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-19 12:33:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 12:33:24,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:24,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:24,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 12:33:24,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:24,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1766449670, now seen corresponding path program 1 times [2024-11-19 12:33:24,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:33:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094301834] [2024-11-19 12:33:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:33:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:33:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:33:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:33:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094301834] [2024-11-19 12:33:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094301834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:33:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:33:24,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 12:33:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976179989] [2024-11-19 12:33:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:33:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:33:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:33:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:33:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:24,169 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:33:24,179 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-11-19 12:33:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:33:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-11-19 12:33:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:33:24,181 INFO L225 Difference]: With dead ends: 37 [2024-11-19 12:33:24,183 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 12:33:24,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:24,185 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:33:24,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:33:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 12:33:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 12:33:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-19 12:33:24,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 18 [2024-11-19 12:33:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:33:24,193 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-19 12:33:24,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-19 12:33:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 12:33:24,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:24,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 12:33:24,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1074634941, now seen corresponding path program 1 times [2024-11-19 12:33:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:33:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703307550] [2024-11-19 12:33:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:33:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:33:24,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:33:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:33:24,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 12:33:24,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:33:24,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:33:24,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:33:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 12:33:24,284 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 12:33:24,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:33:24,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:33:24 BoogieIcfgContainer [2024-11-19 12:33:24,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:33:24,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:33:24,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:33:24,313 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:33:24,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:23" (3/4) ... [2024-11-19 12:33:24,316 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:33:24,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:33:24,318 INFO L158 Benchmark]: Toolchain (without parser) took 2217.12ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 66.3MB in the beginning and 131.7MB in the end (delta: -65.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:24,318 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:24,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 971.85ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 66.1MB in the beginning and 98.7MB in the end (delta: -32.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-19 12:33:24,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.64ms. Allocated memory is still 186.6MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:33:24,320 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 186.6MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:33:24,321 INFO L158 Benchmark]: RCFGBuilder took 398.32ms. Allocated memory is still 186.6MB. Free memory was 92.4MB in the beginning and 75.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 12:33:24,321 INFO L158 Benchmark]: TraceAbstraction took 735.00ms. Allocated memory is still 186.6MB. Free memory was 74.5MB in the beginning and 131.7MB in the end (delta: -57.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:24,321 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 186.6MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:24,324 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.11ms. Allocated memory is still 138.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 971.85ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 66.1MB in the beginning and 98.7MB in the end (delta: -32.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.64ms. Allocated memory is still 186.6MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 186.6MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.32ms. Allocated memory is still 186.6MB. Free memory was 92.4MB in the beginning and 75.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 735.00ms. Allocated memory is still 186.6MB. Free memory was 74.5MB in the beginning and 131.7MB in the end (delta: -57.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 186.6MB. Free memory is still 131.7MB. 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: 1561]: 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 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_07_bad() [L1551] int data; [L1552] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1555] 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, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 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, staticFive=5] [L1559] 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, staticFive=5] [L1561] 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, staticFive=5] - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 104 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 6, 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.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:33:24,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_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 d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:33:26,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:33:26,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:33:26,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:33:26,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:33:26,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:33:26,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:33:26,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:33:26,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:33:26,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:33:26,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:33:26,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:33:26,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:33:26,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:33:26,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:33:26,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:33:26,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:33:26,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:33:26,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:33:26,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:33:26,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:33:26,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:33:26,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:33:26,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:33:26,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:33:26,256 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:33:26,256 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:33:26,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:33:26,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:33:26,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:33:26,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:33:26,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:33:26,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:33:26,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:33:26,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:33:26,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:33:26,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:33:26,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:33:26,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:33:26,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:33:26,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:33:26,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:33:26,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:33:26,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:33:26,259 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 -> d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 [2024-11-19 12:33:26,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:33:26,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:33:26,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:33:26,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:33:26,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:33:26,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:27,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:33:28,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:33:28,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:28,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f341b7a5/d6182c42d24a45c29ed043d997274646/FLAGc33b83522 [2024-11-19 12:33:28,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f341b7a5/d6182c42d24a45c29ed043d997274646 [2024-11-19 12:33:28,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:33:28,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:33:28,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:33:28,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:33:28,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:33:28,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:28" (1/1) ... [2024-11-19 12:33:28,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9d4744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:28, skipping insertion in model container [2024-11-19 12:33:28,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:28" (1/1) ... [2024-11-19 12:33:28,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:33:29,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:33:29,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:33:29,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:33:29,374 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:33:29,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29 WrapperNode [2024-11-19 12:33:29,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:33:29,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:33:29,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:33:29,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:33:29,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,428 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-19 12:33:29,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:33:29,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:33:29,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:33:29,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:33:29,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,462 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:33:29,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:33:29,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:33:29,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:33:29,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:33:29,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (1/1) ... [2024-11-19 12:33:29,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:33:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:33:29,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 12:33:29,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 12:33:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:33:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:33:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:33:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:33:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:33:29,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:33:29,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:33:29,809 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-19 12:33:29,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:33:29,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:33:29,821 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:33:29,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:29 BoogieIcfgContainer [2024-11-19 12:33:29,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:33:29,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:33:29,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:33:29,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:33:29,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:33:28" (1/3) ... [2024-11-19 12:33:29,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa60900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:29, skipping insertion in model container [2024-11-19 12:33:29,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:29" (2/3) ... [2024-11-19 12:33:29,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa60900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:33:29, skipping insertion in model container [2024-11-19 12:33:29,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:29" (3/3) ... [2024-11-19 12:33:29,829 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-19 12:33:29,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:33:29,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:33:29,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:33:29,889 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;@6c7a92e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:33:29,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:33:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 12:33:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:33:29,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:29,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:29,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:29,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1258159597, now seen corresponding path program 1 times [2024-11-19 12:33:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:33:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107924677] [2024-11-19 12:33:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:29,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:29,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:33:29,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:33:29,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 12:33:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:33:30,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:33:30,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:33:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:33:30,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:33:30,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:33:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107924677] [2024-11-19 12:33:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107924677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:33:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:33:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 12:33:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330148036] [2024-11-19 12:33:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:33:30,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:33:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:33:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:33:30,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:30,097 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:33:30,114 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-19 12:33:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:33:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 12:33:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:33:30,123 INFO L225 Difference]: With dead ends: 41 [2024-11-19 12:33:30,124 INFO L226 Difference]: Without dead ends: 17 [2024-11-19 12:33:30,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:30,129 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:33:30,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:33:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-19 12:33:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 12:33:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-19 12:33:30,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-11-19 12:33:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:33:30,155 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-19 12:33:30,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-19 12:33:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 12:33:30,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:30,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:30,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 12:33:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:30,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:30,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1822236216, now seen corresponding path program 1 times [2024-11-19 12:33:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:33:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237339583] [2024-11-19 12:33:30,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:33:30,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:33:30,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 12:33:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:33:30,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:33:30,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:33:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:33:30,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:33:30,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:33:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237339583] [2024-11-19 12:33:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237339583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:33:30,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:33:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 12:33:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556033883] [2024-11-19 12:33:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:33:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:33:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:33:30,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:33:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:30,449 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:33:30,463 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-19 12:33:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:33:30,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) Word has length 14 [2024-11-19 12:33:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:33:30,464 INFO L225 Difference]: With dead ends: 17 [2024-11-19 12:33:30,464 INFO L226 Difference]: Without dead ends: 16 [2024-11-19 12:33:30,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:33:30,466 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:33:30,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:33:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-19 12:33:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 12:33:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-19 12:33:30,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-19 12:33:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:33:30,471 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-19 12:33:30,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:33:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-19 12:33:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 12:33:30,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:33:30,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:33:30,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 12:33:30,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:30,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:33:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:33:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 654747913, now seen corresponding path program 1 times [2024-11-19 12:33:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:33:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980537287] [2024-11-19 12:33:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:33:30,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:33:30,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:33:30,682 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 (4)] Waiting until timeout for monitored process [2024-11-19 12:33:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:33:30,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:33:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:33:30,763 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 12:33:30,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:33:30,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:33:30,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:33:30,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 12:33:30,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:33:30,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 12:33:30,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:33:30,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:33:30 BoogieIcfgContainer [2024-11-19 12:33:30,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:33:30,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:33:30,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:33:30,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:33:30,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:33:29" (3/4) ... [2024-11-19 12:33:30,999 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:33:31,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:33:31,001 INFO L158 Benchmark]: Toolchain (without parser) took 2558.56ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 31.5MB in the beginning and 49.5MB in the end (delta: -18.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,001 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:31,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 931.98ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 31.3MB in the beginning and 73.8MB in the end (delta: -42.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.23ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 71.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,002 INFO L158 Benchmark]: Boogie Preprocessor took 59.26ms. Allocated memory is still 111.1MB. Free memory was 71.1MB in the beginning and 68.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,002 INFO L158 Benchmark]: RCFGBuilder took 333.16ms. Allocated memory is still 111.1MB. Free memory was 68.4MB in the beginning and 54.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,002 INFO L158 Benchmark]: TraceAbstraction took 1171.75ms. Allocated memory is still 111.1MB. Free memory was 53.7MB in the beginning and 49.7MB in the end (delta: 4.0MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-19 12:33:31,002 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 111.1MB. Free memory was 49.7MB in the beginning and 49.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:33:31,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 931.98ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 31.3MB in the beginning and 73.8MB in the end (delta: -42.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.23ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 71.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.26ms. Allocated memory is still 111.1MB. Free memory was 71.1MB in the beginning and 68.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.16ms. Allocated memory is still 111.1MB. Free memory was 68.4MB in the beginning and 54.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1171.75ms. Allocated memory is still 111.1MB. Free memory was 53.7MB in the beginning and 49.7MB in the end (delta: 4.0MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 111.1MB. Free memory was 49.7MB in the beginning and 49.5MB in the end (delta: 151.8kB). 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: 1561]: 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 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_07_bad() [L1551] int data; [L1552] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] 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, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1559] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1561] 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, staticFive=5] - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 6, 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.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:33:31,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample