./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_45_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_45_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e60083b35e5d32628f129c2d97f1e88ab8f2c86e1abe37750d7ed50dada9ab1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:42:49,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:42:49,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:42:49,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:42:49,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:42:49,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:42:49,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:42:49,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:42:49,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:42:49,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:42:49,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:42:49,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:42:49,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:42:49,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:42:49,910 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:42:49,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:42:49,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:42:49,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:42:49,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:42:49,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:42:49,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:42:49,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:42:49,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:42:49,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:42:49,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:42:49,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:42:49,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:49,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:42:49,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:42:49,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:49,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:42:49,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:42:49,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:42:49,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:42:49,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:42:49,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> e60083b35e5d32628f129c2d97f1e88ab8f2c86e1abe37750d7ed50dada9ab1c [2025-01-10 04:42:50,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:42:50,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:42:50,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:42:50,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:42:50,213 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:42:50,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_45_bad.i [2025-01-10 04:42:51,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/776fab81e/3991e01135bb41b1aec0df652ab5e859/FLAG4912aa676 [2025-01-10 04:42:51,950 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:42:51,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_45_bad.i [2025-01-10 04:42:51,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/776fab81e/3991e01135bb41b1aec0df652ab5e859/FLAG4912aa676 [2025-01-10 04:42:51,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/776fab81e/3991e01135bb41b1aec0df652ab5e859 [2025-01-10 04:42:51,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:42:51,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:42:51,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:42:51,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:42:52,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:42:52,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:42:51" (1/1) ... [2025-01-10 04:42:52,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52, skipping insertion in model container [2025-01-10 04:42:52,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:42:51" (1/1) ... [2025-01-10 04:42:52,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:42:52,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:42:52,727 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:42:52,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:42:52,888 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:42:52,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52 WrapperNode [2025-01-10 04:42:52,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:42:52,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:42:52,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:42:52,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:42:52,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,922 INFO L138 Inliner]: procedures = 498, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2025-01-10 04:42:52,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:42:52,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:42:52,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:42:52,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:42:52,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,957 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:42:52,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:42:52,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:42:52,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:42:52,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:42:52,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (1/1) ... [2025-01-10 04:42:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:42:53,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 04:42:53,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 04:42:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:42:53,028 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:42:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:42:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:42:53,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:42:53,197 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:42:53,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:42:53,427 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-01-10 04:42:53,427 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:42:53,439 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:42:53,439 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:42:53,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:53 BoogieIcfgContainer [2025-01-10 04:42:53,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:42:53,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:42:53,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:42:53,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:42:53,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:42:51" (1/3) ... [2025-01-10 04:42:53,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:42:53, skipping insertion in model container [2025-01-10 04:42:53,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:52" (2/3) ... [2025-01-10 04:42:53,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:42:53, skipping insertion in model container [2025-01-10 04:42:53,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:53" (3/3) ... [2025-01-10 04:42:53,453 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_45_bad.i [2025-01-10 04:42:53,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:42:53,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_45_bad.i that has 2 procedures, 43 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 04:42:53,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:42:53,544 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;@6116f06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:42:53,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-10 04:42:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 39 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:42:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 04:42:53,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:53,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:53,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 04:42:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 858330459, now seen corresponding path program 1 times [2025-01-10 04:42:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-01-10 04:42:53,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:53,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 04:42:53,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 04:42:53,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:53,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-01-10 04:42:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331774527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315713428] [2025-01-10 04:42:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:53,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:53,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:53,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:53,840 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 39 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:53,867 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2025-01-10 04:42:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 04:42:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:53,874 INFO L225 Difference]: With dead ends: 43 [2025-01-10 04:42:53,874 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 04:42:53,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:53,879 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:53,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 04:42:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 04:42:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2025-01-10 04:42:53,909 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2025-01-10 04:42:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-01-10 04:42:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2025-01-10 04:42:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 04:42:53,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:53,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:53,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:42:53,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 04:42:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 838440581, now seen corresponding path program 1 times [2025-01-10 04:42:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715580989] [2025-01-10 04:42:53,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:53,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 04:42:53,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 04:42:53,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:53,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715580989] [2025-01-10 04:42:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715580989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 04:42:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506452240] [2025-01-10 04:42:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:54,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 04:42:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:54,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 04:42:54,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 04:42:54,263 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:54,328 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-01-10 04:42:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 04:42:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 04:42:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:54,329 INFO L225 Difference]: With dead ends: 40 [2025-01-10 04:42:54,329 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 04:42:54,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 04:42:54,330 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:54,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 04:42:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 04:42:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 04:42:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-10 04:42:54,336 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 17 [2025-01-10 04:42:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:54,338 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-10 04:42:54,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-10 04:42:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 04:42:54,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:54,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:54,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:42:54,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 04:42:54,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1488452897, now seen corresponding path program 1 times [2025-01-10 04:42:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925440388] [2025-01-10 04:42:54,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:54,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 04:42:54,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 04:42:54,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 04:42:54,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 04:42:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 04:42:54,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 04:42:54,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:54,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 04:42:54,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 04:42:54,421 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 04:42:54,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-01-10 04:42:54,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-01-10 04:42:54,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:42:54,425 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 04:42:54,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:42:54,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:42:54 BoogieIcfgContainer [2025-01-10 04:42:54,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:42:54,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:42:54,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:42:54,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:42:54,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:53" (3/4) ... [2025-01-10 04:42:54,444 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 04:42:54,481 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-01-10 04:42:54,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:42:54,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:42:54,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:42:54,516 INFO L158 Benchmark]: Toolchain (without parser) took 2520.25ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 100.3MB in the end (delta: 4.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,516 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:42:54,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 891.71ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 44.7MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 44.7MB in the beginning and 42.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,517 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 142.6MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:42:54,517 INFO L158 Benchmark]: RCFGBuilder took 466.19ms. Allocated memory is still 142.6MB. Free memory was 40.3MB in the beginning and 94.8MB in the end (delta: -54.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,517 INFO L158 Benchmark]: TraceAbstraction took 1000.02ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 106.5MB in the end (delta: -12.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,517 INFO L158 Benchmark]: Witness Printer took 72.67ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 100.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:42:54,518 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 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 891.71ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 44.7MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 44.7MB in the beginning and 42.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 142.6MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 466.19ms. Allocated memory is still 142.6MB. Free memory was 40.3MB in the beginning and 94.8MB in the end (delta: -54.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1000.02ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 106.5MB in the end (delta: -12.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 72.67ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 100.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 1556]: integer overflow possible integer overflow possible We found a FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int CWE190_Integer_Overflow__int_rand_multiply_45_badData; [L1549] static int CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData; [L1550] static int CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData; VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1571] RET printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1572] CALL CWE190_Integer_Overflow__int_rand_multiply_45_bad() [L1562] int data; [L1563] data = 0 [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1564] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1565] CWE190_Integer_Overflow__int_rand_multiply_45_badData = data [L1566] CALL badSink() [L1553] int data = CWE190_Integer_Overflow__int_rand_multiply_45_badData; VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=2147483647, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, 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] [L1554] COND TRUE data > 0 VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=2147483647, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] data * 2 VAL [CWE190_Integer_Overflow__int_rand_multiply_45_badData=2147483647, CWE190_Integer_Overflow__int_rand_multiply_45_goodB2GData=0, CWE190_Integer_Overflow__int_rand_multiply_45_goodG2BData=0, 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: 1556]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 93 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 04:42:54,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)