./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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_max_multiply_12_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 1bf3ce7c186a0a38f212dd053145f5ff10021faeb74a94c9f9222b20630dc286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:15:09,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:15:10,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 06:15:10,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:15:10,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:15:10,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:15:10,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:15:10,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:15:10,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:15:10,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:15:10,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:15:10,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:15:10,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:15:10,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:15:10,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:15:10,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:15:10,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:15:10,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 06:15:10,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:15:10,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:15:10,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:15:10,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:15:10,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:15:10,055 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:15:10,056 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:15:10,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:15:10,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:15:10,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:15:10,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:15:10,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:15:10,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:15:10,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:15:10,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:15:10,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:15:10,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:15:10,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 06:15:10,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 06:15:10,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:15:10,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:15:10,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:15:10,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:15:10,064 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 -> 1bf3ce7c186a0a38f212dd053145f5ff10021faeb74a94c9f9222b20630dc286 [2024-11-17 06:15:10,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:15:10,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:15:10,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:15:10,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:15:10,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:15:10,352 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_max_multiply_12_bad.i [2024-11-17 06:15:11,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:15:12,133 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:15:12,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_12_bad.i [2024-11-17 06:15:12,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8057f9264/ba4884c4d6de4cbfa2a0e7654a3201a5/FLAGd54fd2942 [2024-11-17 06:15:12,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8057f9264/ba4884c4d6de4cbfa2a0e7654a3201a5 [2024-11-17 06:15:12,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:15:12,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:15:12,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:15:12,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:15:12,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:15:12,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:15:12" (1/1) ... [2024-11-17 06:15:12,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11df5d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:12, skipping insertion in model container [2024-11-17 06:15:12,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:15:12" (1/1) ... [2024-11-17 06:15:12,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:15:13,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:15:13,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:15:13,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:15:13,302 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:15:13,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13 WrapperNode [2024-11-17 06:15:13,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:15:13,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:15:13,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:15:13,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:15:13,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,367 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-17 06:15:13,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:15:13,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:15:13,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:15:13,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:15:13,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,403 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:15:13,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:15:13,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:15:13,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:15:13,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:15:13,430 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (1/1) ... [2024-11-17 06:15:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:15:13,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:15:13,464 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-17 06:15:13,470 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-17 06:15:13,515 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-17 06:15:13,515 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-17 06:15:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-17 06:15:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-17 06:15:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:15:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:15:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:15:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:15:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:15:13,650 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:15:13,652 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:15:13,705 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2024-11-17 06:15:13,794 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 06:15:13,794 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:15:13,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:15:13,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:15:13,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:13 BoogieIcfgContainer [2024-11-17 06:15:13,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:15:13,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:15:13,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:15:13,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:15:13,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:15:12" (1/3) ... [2024-11-17 06:15:13,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639585c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:15:13, skipping insertion in model container [2024-11-17 06:15:13,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:13" (2/3) ... [2024-11-17 06:15:13,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639585c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:15:13, skipping insertion in model container [2024-11-17 06:15:13,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:13" (3/3) ... [2024-11-17 06:15:13,824 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_12_bad.i [2024-11-17 06:15:13,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:15:13,842 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 06:15:13,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:15:13,917 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;@2ee8ba44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:15:13,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 06:15:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 06:15:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 06:15:13,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:13,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:13,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:13,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1383586756, now seen corresponding path program 1 times [2024-11-17 06:15:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:15:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467160598] [2024-11-17 06:15:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:13,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:15:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:15:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 06:15:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 06:15:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 06:15:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:15:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467160598] [2024-11-17 06:15:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467160598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:15:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:15:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:15:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574472926] [2024-11-17 06:15:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:15:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:15:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:15:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:15:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:15:14,381 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:15:14,458 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2024-11-17 06:15:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:15:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-17 06:15:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:15:14,466 INFO L225 Difference]: With dead ends: 77 [2024-11-17 06:15:14,467 INFO L226 Difference]: Without dead ends: 34 [2024-11-17 06:15:14,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-17 06:15:14,476 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 06:15:14,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 06:15:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-17 06:15:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-17 06:15:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 06:15:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-17 06:15:14,515 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2024-11-17 06:15:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:15:14,518 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-17 06:15:14,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-17 06:15:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 06:15:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:14,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:14,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 06:15:14,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:14,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -423867707, now seen corresponding path program 1 times [2024-11-17 06:15:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:15:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666840484] [2024-11-17 06:15:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:15:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:15:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 06:15:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 06:15:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 06:15:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:15:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666840484] [2024-11-17 06:15:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666840484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:15:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:15:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:15:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216105701] [2024-11-17 06:15:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:15:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:15:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:15:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:15:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:15:14,655 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:15:14,676 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-17 06:15:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:15:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-17 06:15:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:15:14,677 INFO L225 Difference]: With dead ends: 35 [2024-11-17 06:15:14,677 INFO L226 Difference]: Without dead ends: 21 [2024-11-17 06:15:14,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-17 06:15:14,679 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:15:14,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:15:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-17 06:15:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 06:15:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 06:15:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-17 06:15:14,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-17 06:15:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:15:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-17 06:15:14,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-17 06:15:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 06:15:14,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:14,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 06:15:14,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -58483537, now seen corresponding path program 1 times [2024-11-17 06:15:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:15:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223450470] [2024-11-17 06:15:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:15:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:15:14,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:15:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:15:14,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 06:15:14,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:15:14,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 06:15:14,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 06:15:14,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 06:15:14,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 06:15:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 06:15:14,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 06:15:14,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:15:14,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:15:14 BoogieIcfgContainer [2024-11-17 06:15:14,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:15:14,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:15:14,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:15:14,754 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:15:14,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:13" (3/4) ... [2024-11-17 06:15:14,756 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:15:14,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:15:14,757 INFO L158 Benchmark]: Toolchain (without parser) took 2413.21ms. Allocated memory is still 172.0MB. Free memory was 99.0MB in the beginning and 96.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,758 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:15:14,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 958.21ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 84.4MB in the end (delta: 14.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.44ms. Allocated memory is still 172.0MB. Free memory was 84.4MB in the beginning and 81.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,759 INFO L158 Benchmark]: Boogie Preprocessor took 54.96ms. Allocated memory is still 172.0MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,759 INFO L158 Benchmark]: IcfgBuilder took 385.15ms. Allocated memory is still 172.0MB. Free memory was 79.6MB in the beginning and 64.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,759 INFO L158 Benchmark]: TraceAbstraction took 937.10ms. Allocated memory is still 172.0MB. Free memory was 64.3MB in the beginning and 97.3MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:15:14,760 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 96.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:15:14,762 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.19ms. Allocated memory is still 172.0MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 958.21ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 84.4MB in the end (delta: 14.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.44ms. Allocated memory is still 172.0MB. Free memory was 84.4MB in the beginning and 81.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.96ms. Allocated memory is still 172.0MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 385.15ms. Allocated memory is still 172.0MB. Free memory was 79.6MB in the beginning and 64.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 937.10ms. Allocated memory is still 172.0MB. Free memory was 64.3MB in the beginning and 97.3MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 96.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1564]: 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 1587. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1587] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1587] 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] [L1588] CALL CWE190_Integer_Overflow__int_max_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] data = 0x7fffffff 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] [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1562] 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] [L1564] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 86 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-17 06:15:14,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_12_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 1bf3ce7c186a0a38f212dd053145f5ff10021faeb74a94c9f9222b20630dc286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:15:16,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:15:17,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 06:15:17,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:15:17,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:15:17,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 06:15:17,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:15:17,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:15:17,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:15:17,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:15:17,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:15:17,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:15:17,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:15:17,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:15:17,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:15:17,072 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:15:17,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:15:17,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:15:17,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:15:17,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:15:17,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:15:17,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:15:17,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 06:15:17,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 06:15:17,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:15:17,077 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:15:17,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 06:15:17,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:15:17,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:15:17,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:15:17,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:15:17,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:15:17,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:15:17,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:15:17,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:15:17,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:15:17,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:15:17,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:15:17,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 06:15:17,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 06:15:17,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:15:17,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:15:17,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:15:17,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:15:17,082 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 -> 1bf3ce7c186a0a38f212dd053145f5ff10021faeb74a94c9f9222b20630dc286 [2024-11-17 06:15:17,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:15:17,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:15:17,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:15:17,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:15:17,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:15:17,437 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_max_multiply_12_bad.i [2024-11-17 06:15:18,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:15:19,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:15:19,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_12_bad.i [2024-11-17 06:15:19,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fef20fad/3682c10c5a754561a6fc40af80be6c9f/FLAGa3d01e90d [2024-11-17 06:15:19,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fef20fad/3682c10c5a754561a6fc40af80be6c9f [2024-11-17 06:15:19,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:15:19,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:15:19,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:15:19,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:15:19,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:15:19,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:15:19" (1/1) ... [2024-11-17 06:15:19,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1506ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:19, skipping insertion in model container [2024-11-17 06:15:19,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:15:19" (1/1) ... [2024-11-17 06:15:19,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:15:20,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:15:20,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:15:20,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:15:20,723 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:15:20,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20 WrapperNode [2024-11-17 06:15:20,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:15:20,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:15:20,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:15:20,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:15:20,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,784 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-11-17 06:15:20,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:15:20,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:15:20,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:15:20,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:15:20,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,814 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:15:20,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:15:20,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:15:20,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:15:20,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:15:20,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (1/1) ... [2024-11-17 06:15:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:15:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:15:20,867 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-17 06:15:20,869 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-17 06:15:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-17 06:15:20,906 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-17 06:15:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-17 06:15:20,906 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-17 06:15:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:15:20,907 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:15:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:15:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:15:20,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:15:21,057 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:15:21,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:15:21,115 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2024-11-17 06:15:21,243 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 06:15:21,243 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:15:21,258 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:15:21,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:15:21,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:21 BoogieIcfgContainer [2024-11-17 06:15:21,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:15:21,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:15:21,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:15:21,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:15:21,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:15:19" (1/3) ... [2024-11-17 06:15:21,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592e83b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:15:21, skipping insertion in model container [2024-11-17 06:15:21,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:15:20" (2/3) ... [2024-11-17 06:15:21,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592e83b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:15:21, skipping insertion in model container [2024-11-17 06:15:21,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:21" (3/3) ... [2024-11-17 06:15:21,270 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_12_bad.i [2024-11-17 06:15:21,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:15:21,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 06:15:21,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:15:21,357 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;@5388446a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:15:21,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 06:15:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 06:15:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 06:15:21,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:21,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:21,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:21,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1431183207, now seen corresponding path program 1 times [2024-11-17 06:15:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:15:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757823020] [2024-11-17 06:15:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:21,388 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-17 06:15:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:15:21,390 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-17 06:15:21,391 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-17 06:15:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:21,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 06:15:21,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:15:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 06:15:21,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:15:21,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:15:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757823020] [2024-11-17 06:15:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757823020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:15:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:15:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:15:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457988189] [2024-11-17 06:15:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:15:21,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:15:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:15:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:15:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:15:21,616 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:15:21,701 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-11-17 06:15:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:15:21,704 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-17 06:15:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:15:21,710 INFO L225 Difference]: With dead ends: 74 [2024-11-17 06:15:21,710 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 06:15:21,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-17 06:15:21,718 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 06:15:21,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 06:15:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 06:15:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-17 06:15:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 06:15:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-17 06:15:21,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2024-11-17 06:15:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:15:21,751 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-17 06:15:21,752 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-17 06:15:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 06:15:21,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:21,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:21,757 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-17 06:15:21,954 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-17 06:15:21,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1120973754, now seen corresponding path program 1 times [2024-11-17 06:15:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:15:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90030756] [2024-11-17 06:15:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:21,956 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-17 06:15:21,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:15:21,959 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-17 06:15:21,960 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-17 06:15:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:15:22,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 06:15:22,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:15:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 06:15:22,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:15:22,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:15:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90030756] [2024-11-17 06:15:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90030756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:15:22,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:15:22,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:15:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031650864] [2024-11-17 06:15:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:15:22,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:15:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:15:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:15:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:15:22,087 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:15:22,119 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-17 06:15:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:15:22,121 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-17 06:15:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:15:22,121 INFO L225 Difference]: With dead ends: 32 [2024-11-17 06:15:22,121 INFO L226 Difference]: Without dead ends: 19 [2024-11-17 06:15:22,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-17 06:15:22,124 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:15:22,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:15:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-17 06:15:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-17 06:15:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 06:15:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-17 06:15:22,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 20 [2024-11-17 06:15:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:15:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-17 06:15:22,131 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 06:15:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-17 06:15:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 06:15:22,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:15:22,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:15:22,147 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-17 06:15:22,333 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-17 06:15:22,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 06:15:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:15:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1417006444, now seen corresponding path program 1 times [2024-11-17 06:15:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:15:22,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432856817] [2024-11-17 06:15:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:15:22,335 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-17 06:15:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:15:22,338 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-17 06:15:22,340 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-17 06:15:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:15:22,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:15:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:15:22,461 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 06:15:22,461 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:15:22,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 06:15:22,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 06:15:22,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 06:15:22,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 06:15:22,474 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-17 06:15:22,665 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-17 06:15:22,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 06:15:22,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:15:22,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:15:22 BoogieIcfgContainer [2024-11-17 06:15:22,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:15:22,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:15:22,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:15:22,721 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:15:22,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:15:21" (3/4) ... [2024-11-17 06:15:22,744 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:15:22,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:15:22,746 INFO L158 Benchmark]: Toolchain (without parser) took 3165.00ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.9MB in the beginning and 50.5MB in the end (delta: -5.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,750 INFO L158 Benchmark]: CDTParser took 1.90ms. Allocated memory is still 52.4MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:15:22,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1142.48ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.7MB in the beginning and 46.4MB in the end (delta: -1.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.49ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 43.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,752 INFO L158 Benchmark]: Boogie Preprocessor took 44.04ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,752 INFO L158 Benchmark]: IcfgBuilder took 429.29ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 46.9MB in the end (delta: -6.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,752 INFO L158 Benchmark]: TraceAbstraction took 1457.84ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 50.5MB in the end (delta: -4.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,753 INFO L158 Benchmark]: Witness Printer took 24.85ms. Allocated memory is still 81.8MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 45.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:15:22,762 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.90ms. Allocated memory is still 52.4MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1142.48ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.7MB in the beginning and 46.4MB in the end (delta: -1.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.49ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 43.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.04ms. Allocated memory is still 81.8MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 429.29ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 46.9MB in the end (delta: -6.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1457.84ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 50.5MB in the end (delta: -4.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 24.85ms. Allocated memory is still 81.8MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 45.2kB). Peak memory consumption was 2.1MB. 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: 1564]: 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 1587. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1587] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1587] 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] [L1588] CALL CWE190_Integer_Overflow__int_max_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] data = 0x7fffffff 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] [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1562] 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] [L1564] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 76 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 114 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-17 06:15:22,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample