./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/CWE191_Integer_Underflow__int_rand_multiply_11_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 e8827376a636983099cbceca13535b7c5c48f141cdc60fcf039bdd74c8836f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:48:29,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:48:29,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:48:29,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:48:29,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:48:29,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:48:29,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:48:29,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:48:29,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:48:29,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:48:29,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:48:29,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:48:29,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:48:29,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:48:29,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:48:29,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:48:29,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:48:29,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:48:29,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:48:29,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:48:29,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:48:29,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:48:29,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:48:29,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:48:29,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:48:29,867 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/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 -> e8827376a636983099cbceca13535b7c5c48f141cdc60fcf039bdd74c8836f20 [2025-03-09 05:48:30,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:48:30,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:48:30,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:48:30,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:48:30,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:48:30,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_11_bad.i [2025-03-09 05:48:31,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa35960f/ece2be5cdf0d41668d268bcf8496f583/FLAG78c103ae8 [2025-03-09 05:48:31,662 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:48:31,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_11_bad.i [2025-03-09 05:48:31,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa35960f/ece2be5cdf0d41668d268bcf8496f583/FLAG78c103ae8 [2025-03-09 05:48:31,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa35960f/ece2be5cdf0d41668d268bcf8496f583 [2025-03-09 05:48:31,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:48:31,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:48:31,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:48:31,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:48:31,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:48:31,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:48:31" (1/1) ... [2025-03-09 05:48:31,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6340505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:31, skipping insertion in model container [2025-03-09 05:48:31,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:48:31" (1/1) ... [2025-03-09 05:48:31,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:48:32,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:48:32,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:48:32,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:48:32,599 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:48:32,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32 WrapperNode [2025-03-09 05:48:32,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:48:32,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:48:32,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:48:32,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:48:32,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,649 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2025-03-09 05:48:32,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:48:32,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:48:32,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:48:32,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:48:32,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,665 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:48:32,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:48:32,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:48:32,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:48:32,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:48:32,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (1/1) ... [2025-03-09 05:48:32,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:48:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:48:32,704 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) [2025-03-09 05:48:32,707 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 [2025-03-09 05:48:32,723 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:48:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:48:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-09 05:48:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-09 05:48:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:48:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:48:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:48:32,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:48:32,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:48:32,983 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-09 05:48:32,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:48:33,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:48:33,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:48:33,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:48:33 BoogieIcfgContainer [2025-03-09 05:48:33,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:48:33,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:48:33,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:48:33,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:48:33,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:48:31" (1/3) ... [2025-03-09 05:48:33,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57843466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:48:33, skipping insertion in model container [2025-03-09 05:48:33,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:48:32" (2/3) ... [2025-03-09 05:48:33,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57843466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:48:33, skipping insertion in model container [2025-03-09 05:48:33,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:48:33" (3/3) ... [2025-03-09 05:48:33,011 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_11_bad.i [2025-03-09 05:48:33,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:48:33,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_multiply_11_bad.i that has 3 procedures, 51 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 05:48:33,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:48:33,070 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;@4e12fa1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:48:33,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 05:48:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 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) [2025-03-09 05:48:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:48:33,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:48:33,079 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:48:33,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 05:48:33,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:48:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2103229159, now seen corresponding path program 1 times [2025-03-09 05:48:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:48:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-03-09 05:48:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:48:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:48:33,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:48:33,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:48:33,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:48:33,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:48:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:48:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:48:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653234233] [2025-03-09 05:48:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653234233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:48:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345881869] [2025-03-09 05:48:33,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:48:33,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:48:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:48:33,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:48:33,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:48:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:48:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:48:33,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:48:33,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:48:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:48:33,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:48:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 05:48:33,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:48:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345881869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:48:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:48:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 05:48:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340081481] [2025-03-09 05:48:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:48:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:48:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:48:33,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:48:33,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:48:33,466 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) 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) [2025-03-09 05:48:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:48:33,498 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-03-09 05:48:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:48:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 [2025-03-09 05:48:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:48:33,504 INFO L225 Difference]: With dead ends: 71 [2025-03-09 05:48:33,504 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 05:48:33,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:48:33,509 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:48:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:48:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 05:48:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 05:48:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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) [2025-03-09 05:48:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2025-03-09 05:48:33,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 22 [2025-03-09 05:48:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:48:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2025-03-09 05:48:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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) [2025-03-09 05:48:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2025-03-09 05:48:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:48:33,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:48:33,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:48:33,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:48:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 05:48:33,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 05:48:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:48:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -749010091, now seen corresponding path program 1 times [2025-03-09 05:48:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:48:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052719386] [2025-03-09 05:48:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:48:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:48:33,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:48:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:48:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:48:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:48:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 05:48:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:48:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052719386] [2025-03-09 05:48:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052719386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:48:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:48:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:48:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462686045] [2025-03-09 05:48:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:48:33,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:48:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:48:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:48:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:48:33,989 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 05:48:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:48:34,073 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-03-09 05:48:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:48:34,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2025-03-09 05:48:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:48:34,074 INFO L225 Difference]: With dead ends: 54 [2025-03-09 05:48:34,074 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 05:48:34,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 05:48:34,075 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 40 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:48:34,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 209 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:48:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 05:48:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 05:48:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 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) [2025-03-09 05:48:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-03-09 05:48:34,078 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2025-03-09 05:48:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:48:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-03-09 05:48:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 05:48:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-03-09 05:48:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:48:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:48:34,079 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:48:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:48:34,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 05:48:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:48:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 187065698, now seen corresponding path program 1 times [2025-03-09 05:48:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:48:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478232197] [2025-03-09 05:48:34,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:48:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:48:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:48:34,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:48:34,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:48:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:48:34,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:48:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:48:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:48:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:48:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:48:34,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:48:34,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:48:34,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 05:48:34,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 05:48:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:48:34,144 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 05:48:34,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:48:34,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:48:34 BoogieIcfgContainer [2025-03-09 05:48:34,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:48:34,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:48:34,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:48:34,177 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:48:34,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:48:33" (3/4) ... [2025-03-09 05:48:34,178 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 05:48:34,218 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-09 05:48:34,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:48:34,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:48:34,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:48:34,253 INFO L158 Benchmark]: Toolchain (without parser) took 2413.84ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 89.2MB in the end (delta: 19.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-09 05:48:34,254 INFO L158 Benchmark]: CDTParser took 1.83ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:48:34,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.30ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 50.1MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 05:48:34,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.31ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:48:34,256 INFO L158 Benchmark]: Boogie Preprocessor took 23.58ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 45.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:48:34,256 INFO L158 Benchmark]: IcfgBuilder took 327.87ms. Allocated memory is still 142.6MB. Free memory was 45.6MB in the beginning and 97.3MB in the end (delta: -51.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-09 05:48:34,256 INFO L158 Benchmark]: TraceAbstraction took 1172.31ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 96.0MB in the end (delta: 519.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:48:34,257 INFO L158 Benchmark]: Witness Printer took 74.15ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.2MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:48:34,257 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.83ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 760.30ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 50.1MB in the end (delta: 58.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.31ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.58ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 45.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.87ms. Allocated memory is still 142.6MB. Free memory was 45.6MB in the beginning and 97.3MB in the end (delta: -51.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1172.31ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 96.0MB in the end (delta: 519.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.15ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.2MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1560]: 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] 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] [L1569] CALL CWE191_Integer_Underflow__int_rand_multiply_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1558] COND TRUE data < 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] 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: 1560]: 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 3 procedures, 51 locations, 73 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 114 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/9 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-03-09 05:48:34,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)