./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_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 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:08:33,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:08:33,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 07:08:33,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:08:33,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:08:33,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:08:33,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:08:33,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:08:33,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:08:33,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:08:33,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:08:33,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:08:33,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:08:33,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:08:33,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:08:33,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:08:33,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:08:33,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 07:08:33,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:08:33,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:08:33,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:08:33,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:08:33,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:08:33,705 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:08:33,705 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:08:33,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:08:33,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:08:33,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:08:33,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:08:33,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:08:33,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:08:33,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:08:33,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:08:33,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:08:33,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:08:33,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 07:08:33,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 07:08:33,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:08:33,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:08:33,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:08:33,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:08:33,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b [2024-11-17 07:08:33,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:08:33,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:08:33,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:08:33,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:08:33,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:08:33,926 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_predec_17_bad.i [2024-11-17 07:08:35,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:08:35,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:08:35,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-11-17 07:08:35,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4402cb7fc/827a8bbdf7cd49fe94045448dec56516/FLAG358e05ba1 [2024-11-17 07:08:35,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4402cb7fc/827a8bbdf7cd49fe94045448dec56516 [2024-11-17 07:08:35,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:08:35,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:08:35,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:08:35,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:08:35,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:08:35,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:08:35" (1/1) ... [2024-11-17 07:08:35,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840221a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:35, skipping insertion in model container [2024-11-17 07:08:35,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:08:35" (1/1) ... [2024-11-17 07:08:35,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:08:36,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:08:36,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:08:36,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:08:36,579 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:08:36,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36 WrapperNode [2024-11-17 07:08:36,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:08:36,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:08:36,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:08:36,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:08:36,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,649 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2024-11-17 07:08:36,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:08:36,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:08:36,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:08:36,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:08:36,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,671 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 07:08:36,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:08:36,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:08:36,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:08:36,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:08:36,689 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (1/1) ... [2024-11-17 07:08:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:08:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:08:36,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 07:08:36,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 07:08:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 07:08:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 07:08:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:08:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:08:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:08:36,877 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:08:36,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:08:37,084 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-17 07:08:37,084 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:08:37,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:08:37,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:08:37,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:37 BoogieIcfgContainer [2024-11-17 07:08:37,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:08:37,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:08:37,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:08:37,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:08:37,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:08:35" (1/3) ... [2024-11-17 07:08:37,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4792e0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:08:37, skipping insertion in model container [2024-11-17 07:08:37,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:36" (2/3) ... [2024-11-17 07:08:37,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4792e0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:08:37, skipping insertion in model container [2024-11-17 07:08:37,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:37" (3/3) ... [2024-11-17 07:08:37,137 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-11-17 07:08:37,162 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:08:37,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 07:08:37,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:08:37,242 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;@a57f8da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:08:37,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 07:08:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:08:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 07:08:37,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:37,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:37,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:37,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1517216571, now seen corresponding path program 1 times [2024-11-17 07:08:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:08:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846522122] [2024-11-17 07:08:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:08:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:08:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:08:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846522122] [2024-11-17 07:08:37,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846522122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:37,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:37,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 07:08:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284899142] [2024-11-17 07:08:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 07:08:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:08:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 07:08:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:08:37,535 INFO L87 Difference]: Start difference. First operand has 57 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 53 states have internal predecessors, (71), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:37,560 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2024-11-17 07:08:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 07:08:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2024-11-17 07:08:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:37,569 INFO L225 Difference]: With dead ends: 81 [2024-11-17 07:08:37,569 INFO L226 Difference]: Without dead ends: 51 [2024-11-17 07:08:37,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:08:37,577 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:37,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-17 07:08:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-17 07:08:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 48 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-17 07:08:37,608 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 13 [2024-11-17 07:08:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:37,608 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-17 07:08:37,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-17 07:08:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 07:08:37,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:37,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:37,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 07:08:37,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash -197013116, now seen corresponding path program 1 times [2024-11-17 07:08:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:08:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958280262] [2024-11-17 07:08:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:08:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:08:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:08:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958280262] [2024-11-17 07:08:37,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958280262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:37,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:37,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:08:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419251101] [2024-11-17 07:08:37,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:08:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:08:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:08:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:08:37,711 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:37,745 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2024-11-17 07:08:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:08:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 07:08:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:37,747 INFO L225 Difference]: With dead ends: 89 [2024-11-17 07:08:37,747 INFO L226 Difference]: Without dead ends: 75 [2024-11-17 07:08:37,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:08:37,748 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:37,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 117 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-17 07:08:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2024-11-17 07:08:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 50 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-11-17 07:08:37,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 14 [2024-11-17 07:08:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:37,754 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-17 07:08:37,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-17 07:08:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 07:08:37,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:37,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:37,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 07:08:37,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1827084700, now seen corresponding path program 1 times [2024-11-17 07:08:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:08:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885994503] [2024-11-17 07:08:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:08:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:08:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:08:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885994503] [2024-11-17 07:08:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885994503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:08:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834435546] [2024-11-17 07:08:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:37,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:08:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:08:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:08:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:08:37,915 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:37,960 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2024-11-17 07:08:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:08:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 [2024-11-17 07:08:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:37,962 INFO L225 Difference]: With dead ends: 80 [2024-11-17 07:08:37,962 INFO L226 Difference]: Without dead ends: 78 [2024-11-17 07:08:37,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:08:37,963 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:37,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 166 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-17 07:08:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-11-17 07:08:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 74 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2024-11-17 07:08:37,970 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 17 [2024-11-17 07:08:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:37,970 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2024-11-17 07:08:37,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2024-11-17 07:08:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 07:08:37,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:37,971 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:37,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 07:08:37,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:37,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash 85695515, now seen corresponding path program 1 times [2024-11-17 07:08:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:08:37,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386758909] [2024-11-17 07:08:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:08:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:08:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:08:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386758909] [2024-11-17 07:08:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386758909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 07:08:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906134019] [2024-11-17 07:08:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 07:08:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:08:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 07:08:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 07:08:38,170 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:38,265 INFO L93 Difference]: Finished difference Result 121 states and 164 transitions. [2024-11-17 07:08:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 07:08:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 25 [2024-11-17 07:08:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:38,266 INFO L225 Difference]: With dead ends: 121 [2024-11-17 07:08:38,266 INFO L226 Difference]: Without dead ends: 120 [2024-11-17 07:08:38,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 07:08:38,267 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:38,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 247 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:08:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-17 07:08:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 92. [2024-11-17 07:08:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 89 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-11-17 07:08:38,281 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 25 [2024-11-17 07:08:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:38,281 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-11-17 07:08:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-11-17 07:08:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 07:08:38,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:38,283 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 07:08:38,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash -960726098, now seen corresponding path program 1 times [2024-11-17 07:08:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:08:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085453480] [2024-11-17 07:08:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:08:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:08:38,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 07:08:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:08:38,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 07:08:38,334 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 07:08:38,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 07:08:38,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 07:08:38,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 07:08:38,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 07:08:38,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 07:08:38,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 07:08:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 07:08:38,340 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-17 07:08:38,361 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 07:08:38,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 07:08:38 BoogieIcfgContainer [2024-11-17 07:08:38,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 07:08:38,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 07:08:38,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 07:08:38,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 07:08:38,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:37" (3/4) ... [2024-11-17 07:08:38,369 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 07:08:38,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 07:08:38,371 INFO L158 Benchmark]: Toolchain (without parser) took 2594.16ms. Allocated memory is still 209.7MB. Free memory was 139.0MB in the beginning and 128.9MB in the end (delta: 10.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-17 07:08:38,371 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:08:38,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 799.83ms. Allocated memory is still 209.7MB. Free memory was 138.8MB in the beginning and 135.8MB in the end (delta: 2.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-17 07:08:38,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.37ms. Allocated memory is still 209.7MB. Free memory was 135.0MB in the beginning and 132.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 07:08:38,372 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 209.7MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 07:08:38,372 INFO L158 Benchmark]: IcfgBuilder took 432.10ms. Allocated memory is still 209.7MB. Free memory was 130.4MB in the beginning and 110.7MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 07:08:38,372 INFO L158 Benchmark]: TraceAbstraction took 1238.28ms. Allocated memory is still 209.7MB. Free memory was 110.7MB in the beginning and 128.9MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:08:38,372 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:08:38,373 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.08ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 799.83ms. Allocated memory is still 209.7MB. Free memory was 138.8MB in the beginning and 135.8MB in the end (delta: 2.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.37ms. Allocated memory is still 209.7MB. Free memory was 135.0MB in the beginning and 132.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 209.7MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 432.10ms. Allocated memory is still 209.7MB. Free memory was 130.4MB in the beginning and 110.7MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1238.28ms. Allocated memory is still 209.7MB. Free memory was 110.7MB in the beginning and 128.9MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); 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 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) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_predec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] --data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 57 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 237 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 07:08:38,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:08:40,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:08:40,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 07:08:40,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:08:40,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:08:40,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 07:08:40,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:08:40,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:08:40,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:08:40,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:08:40,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:08:40,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:08:40,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:08:40,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:08:40,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:08:40,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:08:40,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:08:40,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:08:40,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:08:40,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:08:40,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:08:40,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:08:40,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 07:08:40,568 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 07:08:40,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:08:40,568 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:08:40,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 07:08:40,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:08:40,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:08:40,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:08:40,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:08:40,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:08:40,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:08:40,573 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 07:08:40,573 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 07:08:40,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:08:40,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:08:40,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:08:40,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:08:40,574 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b [2024-11-17 07:08:40,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:08:40,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:08:40,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:08:40,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:08:40,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:08:40,891 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_predec_17_bad.i [2024-11-17 07:08:42,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:08:42,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:08:42,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-11-17 07:08:42,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f786121/c87a11f6688c4de48b350e2fd6f97ff7/FLAG5903afb50 [2024-11-17 07:08:42,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f786121/c87a11f6688c4de48b350e2fd6f97ff7 [2024-11-17 07:08:42,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:08:42,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:08:42,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:08:42,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:08:42,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:08:42,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:08:42" (1/1) ... [2024-11-17 07:08:42,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d57a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:42, skipping insertion in model container [2024-11-17 07:08:42,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:08:42" (1/1) ... [2024-11-17 07:08:42,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:08:43,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:08:43,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:08:43,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:08:43,974 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:08:43,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43 WrapperNode [2024-11-17 07:08:43,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:08:43,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:08:43,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:08:43,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:08:43,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,019 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2024-11-17 07:08:44,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:08:44,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:08:44,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:08:44,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:08:44,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,037 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 07:08:44,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:08:44,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:08:44,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:08:44,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:08:44,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (1/1) ... [2024-11-17 07:08:44,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:08:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:08:44,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 07:08:44,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 07:08:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 07:08:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 07:08:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:08:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:08:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:08:44,313 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:08:44,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:08:44,423 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-17 07:08:44,424 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:08:44,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:08:44,432 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:08:44,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:44 BoogieIcfgContainer [2024-11-17 07:08:44,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:08:44,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:08:44,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:08:44,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:08:44,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:08:42" (1/3) ... [2024-11-17 07:08:44,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3794c9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:08:44, skipping insertion in model container [2024-11-17 07:08:44,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:08:43" (2/3) ... [2024-11-17 07:08:44,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3794c9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:08:44, skipping insertion in model container [2024-11-17 07:08:44,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:44" (3/3) ... [2024-11-17 07:08:44,439 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-11-17 07:08:44,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:08:44,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 07:08:44,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:08:44,533 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;@513def48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:08:44,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 07:08:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 07:08:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 07:08:44,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:44,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:44,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:44,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash 453705361, now seen corresponding path program 1 times [2024-11-17 07:08:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:08:44,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802968073] [2024-11-17 07:08:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:08:44,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:08:44,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 07:08:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:44,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 07:08:44,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:08:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:44,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:08:44,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:08:44,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802968073] [2024-11-17 07:08:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802968073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 07:08:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645410343] [2024-11-17 07:08:44,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 07:08:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:08:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 07:08:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:08:44,700 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:44,722 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-17 07:08:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 07:08:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2024-11-17 07:08:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:44,727 INFO L225 Difference]: With dead ends: 59 [2024-11-17 07:08:44,728 INFO L226 Difference]: Without dead ends: 28 [2024-11-17 07:08:44,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 07:08:44,731 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:44,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-17 07:08:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-17 07:08:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-17 07:08:44,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2024-11-17 07:08:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:44,760 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-17 07:08:44,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-17 07:08:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 07:08:44,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:44,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:44,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 07:08:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:44,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1177871016, now seen corresponding path program 1 times [2024-11-17 07:08:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:08:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923128982] [2024-11-17 07:08:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:44,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:08:44,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:08:44,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 07:08:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:45,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 07:08:45,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:08:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:45,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:08:45,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:08:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923128982] [2024-11-17 07:08:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923128982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:08:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873999667] [2024-11-17 07:08:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:45,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 07:08:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:08:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 07:08:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:08:45,075 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:45,086 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-17 07:08:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 07:08:45,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 07:08:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:45,087 INFO L225 Difference]: With dead ends: 44 [2024-11-17 07:08:45,087 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 07:08:45,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 07:08:45,088 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:45,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 07:08:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-17 07:08:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-17 07:08:45,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2024-11-17 07:08:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:45,093 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-17 07:08:45,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-17 07:08:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 07:08:45,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:45,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:45,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 07:08:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:45,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1179964299, now seen corresponding path program 1 times [2024-11-17 07:08:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:08:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358635807] [2024-11-17 07:08:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:45,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:08:45,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:08:45,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 07:08:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:08:45,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:08:45,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:08:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 07:08:45,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:08:45,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:08:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358635807] [2024-11-17 07:08:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358635807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:08:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:08:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:08:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346781090] [2024-11-17 07:08:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:08:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:08:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:08:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:08:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:08:45,397 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:08:45,432 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-17 07:08:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:08:45,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 07:08:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:08:45,435 INFO L225 Difference]: With dead ends: 36 [2024-11-17 07:08:45,435 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 07:08:45,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:08:45,437 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:08:45,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:08:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 07:08:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-17 07:08:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-17 07:08:45,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2024-11-17 07:08:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:08:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-17 07:08:45,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 07:08:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-17 07:08:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 07:08:45,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:08:45,443 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:08:45,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 07:08:45,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:45,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 07:08:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:08:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1240239416, now seen corresponding path program 1 times [2024-11-17 07:08:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:08:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905679596] [2024-11-17 07:08:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:08:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:45,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:08:45,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 07:08:45,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 07:08:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:08:45,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 07:08:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:08:45,740 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 07:08:45,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 07:08:45,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 07:08:45,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 07:08:45,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 07:08:45,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 07:08:45,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 07:08:45,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 07:08:45,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 07:08:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 07:08:45,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 07:08:45,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 07:08:45,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 07:08:45 BoogieIcfgContainer [2024-11-17 07:08:45,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 07:08:45,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 07:08:45,991 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 07:08:45,991 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 07:08:45,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:08:44" (3/4) ... [2024-11-17 07:08:45,993 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 07:08:45,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 07:08:45,994 INFO L158 Benchmark]: Toolchain (without parser) took 3117.73ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.2MB in the beginning and 84.7MB in the end (delta: -43.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,995 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:08:45,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1093.36ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 41.0MB in the beginning and 45.7MB in the end (delta: -4.7MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.78ms. Allocated memory is still 96.5MB. Free memory was 45.7MB in the beginning and 42.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,995 INFO L158 Benchmark]: Boogie Preprocessor took 30.21ms. Allocated memory is still 96.5MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,996 INFO L158 Benchmark]: IcfgBuilder took 382.08ms. Allocated memory is still 96.5MB. Free memory was 39.9MB in the beginning and 54.3MB in the end (delta: -14.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,996 INFO L158 Benchmark]: TraceAbstraction took 1556.36ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 85.4MB in the end (delta: -31.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-17 07:08:45,996 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 84.7MB in the end (delta: 718.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:08:45,998 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.68ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1093.36ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 41.0MB in the beginning and 45.7MB in the end (delta: -4.7MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.78ms. Allocated memory is still 96.5MB. Free memory was 45.7MB in the beginning and 42.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.21ms. Allocated memory is still 96.5MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 382.08ms. Allocated memory is still 96.5MB. Free memory was 39.9MB in the beginning and 54.3MB in the end (delta: -14.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1556.36ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 85.4MB in the end (delta: -31.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 117.4MB. Free memory was 85.4MB in the beginning and 84.7MB in the end (delta: 718.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); 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 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) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_predec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] --data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 37 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 93 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 07:08:46,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample