./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_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 9cd8abd463896cab71131a4329cf3679cd4559f0c11b6170ba6b3a9c816efc8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:31:22,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:31:23,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 20:31:23,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:31:23,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:31:23,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:31:23,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:31:23,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:31:23,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:31:23,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:31:23,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:31:23,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:31:23,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:31:23,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:31:23,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:31:23,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:31:23,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:31:23,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 20:31:23,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:31:23,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:31:23,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:31:23,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:31:23,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:31:23,051 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:31:23,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:31:23,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:31:23,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:31:23,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:31:23,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:31:23,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:31:23,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:31:23,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:31:23,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:31:23,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:31:23,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:31:23,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 20:31:23,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 20:31:23,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:31:23,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:31:23,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:31:23,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:31:23,057 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 -> 9cd8abd463896cab71131a4329cf3679cd4559f0c11b6170ba6b3a9c816efc8a [2024-11-20 20:31:23,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:31:23,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:31:23,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:31:23,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:31:23,317 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:31:23,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:24,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:31:25,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:31:25,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:25,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa62a022d/757f9d2865ba4738a6e1b5b1987e3b71/FLAGa7a47132d [2024-11-20 20:31:25,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa62a022d/757f9d2865ba4738a6e1b5b1987e3b71 [2024-11-20 20:31:25,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:31:25,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:31:25,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:31:25,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:31:25,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:31:25,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:25" (1/1) ... [2024-11-20 20:31:25,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673c44f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:25, skipping insertion in model container [2024-11-20 20:31:25,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:25" (1/1) ... [2024-11-20 20:31:25,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:31:26,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:31:26,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:31:26,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:31:26,200 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:31:26,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26 WrapperNode [2024-11-20 20:31:26,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:31:26,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:31:26,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:31:26,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:31:26,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,275 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2024-11-20 20:31:26,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:31:26,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:31:26,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:31:26,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:31:26,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,315 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:31:26,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:31:26,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:31:26,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:31:26,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:31:26,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (1/1) ... [2024-11-20 20:31:26,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:31:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:31:26,373 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-20 20:31:26,375 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-20 20:31:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:31:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:31:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:31:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:31:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:31:26,547 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:31:26,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:31:26,778 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-20 20:31:26,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:31:26,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:31:26,793 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:31:26,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:26 BoogieIcfgContainer [2024-11-20 20:31:26,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:31:26,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:31:26,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:31:26,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:31:26,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:31:25" (1/3) ... [2024-11-20 20:31:26,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff304f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:26, skipping insertion in model container [2024-11-20 20:31:26,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:26" (2/3) ... [2024-11-20 20:31:26,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff304f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:26, skipping insertion in model container [2024-11-20 20:31:26,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:26" (3/3) ... [2024-11-20 20:31:26,802 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:26,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:31:26,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:31:26,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:31:26,871 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;@ae8d2e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:31:26,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:31:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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-20 20:31:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 20:31:26,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:26,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:26,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:26,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash 433338487, now seen corresponding path program 1 times [2024-11-20 20:31:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:31:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368340183] [2024-11-20 20:31:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:31:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:31:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,221 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-20 20:31:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:31:27,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368340183] [2024-11-20 20:31:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368340183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:31:27,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:31:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 20:31:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297039133] [2024-11-20 20:31:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:31:27,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:31:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:31:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:31:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:31:27,268 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-20 20:31:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:31:27,294 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-20 20:31:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:31:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-11-20 20:31:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:31:27,306 INFO L225 Difference]: With dead ends: 59 [2024-11-20 20:31:27,307 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 20:31:27,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 20:31:27,314 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:31:27,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:31:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 20:31:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 20:31:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:31:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 20:31:27,354 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 11 [2024-11-20 20:31:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:31:27,354 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 20:31:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-20 20:31:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 20:31:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 20:31:27,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:27,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 20:31:27,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:27,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -423377772, now seen corresponding path program 1 times [2024-11-20 20:31:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:31:27,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919608837] [2024-11-20 20:31:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:31:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:31:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,717 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-20 20:31:27,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:31:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919608837] [2024-11-20 20:31:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919608837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:31:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:31:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 20:31:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948936724] [2024-11-20 20:31:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:31:27,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 20:31:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:31:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 20:31:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 20:31:27,722 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-20 20:31:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:31:27,840 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-20 20:31:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 20:31:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-20 20:31:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:31:27,842 INFO L225 Difference]: With dead ends: 42 [2024-11-20 20:31:27,842 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 20:31:27,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 20:31:27,843 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 20:31:27,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 20:31:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 20:31:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-20 20:31:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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-20 20:31:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-20 20:31:27,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2024-11-20 20:31:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:31:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-20 20:31:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 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-20 20:31:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-20 20:31:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 20:31:27,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:27,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 20:31:27,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1868440622, now seen corresponding path program 1 times [2024-11-20 20:31:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:31:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601328134] [2024-11-20 20:31:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:31:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:31:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:27,988 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-20 20:31:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:31:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601328134] [2024-11-20 20:31:27,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601328134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:31:27,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:31:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 20:31:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571411482] [2024-11-20 20:31:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:31:27,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 20:31:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:31:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 20:31:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 20:31:27,991 INFO L87 Difference]: Start difference. First operand 40 states and 53 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-20 20:31:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:31:28,011 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-20 20:31:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 20:31:28,012 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-20 20:31:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:31:28,013 INFO L225 Difference]: With dead ends: 40 [2024-11-20 20:31:28,013 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 20:31:28,013 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-20 20:31:28,014 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:31:28,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 97 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:31:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 20:31:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-20 20:31:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 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-20 20:31:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-20 20:31:28,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2024-11-20 20:31:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:31:28,023 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-20 20:31:28,023 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-20 20:31:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-20 20:31:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 20:31:28,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:28,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:28,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 20:31:28,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:28,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash -239808910, now seen corresponding path program 1 times [2024-11-20 20:31:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:31:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481684024] [2024-11-20 20:31:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:31:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:31:28,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:31:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:31:28,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 20:31:28,092 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:31:28,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:31:28,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:31:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 20:31:28,099 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 20:31:28,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:31:28,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:31:28 BoogieIcfgContainer [2024-11-20 20:31:28,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:31:28,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:31:28,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:31:28,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:31:28,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:26" (3/4) ... [2024-11-20 20:31:28,137 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:31:28,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:31:28,139 INFO L158 Benchmark]: Toolchain (without parser) took 2997.37ms. Allocated memory is still 151.0MB. Free memory was 79.1MB in the beginning and 99.7MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:31:28,140 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:31:28,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1058.21ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 72.3MB in the end (delta: 6.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:28,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.40ms. Allocated memory is still 151.0MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:28,141 INFO L158 Benchmark]: Boogie Preprocessor took 56.69ms. Allocated memory is still 151.0MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:28,141 INFO L158 Benchmark]: RCFGBuilder took 458.72ms. Allocated memory is still 151.0MB. Free memory was 66.8MB in the beginning and 116.9MB in the end (delta: -50.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-20 20:31:28,141 INFO L158 Benchmark]: TraceAbstraction took 1336.79ms. Allocated memory is still 151.0MB. Free memory was 115.9MB in the beginning and 99.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:28,141 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 151.0MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:31:28,147 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.16ms. Allocated memory is still 119.5MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1058.21ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 72.3MB in the end (delta: 6.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.40ms. Allocated memory is still 151.0MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.69ms. Allocated memory is still 151.0MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.72ms. Allocated memory is still 151.0MB. Free memory was 66.8MB in the beginning and 116.9MB in the end (delta: -50.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1336.79ms. Allocated memory is still 151.0MB. Free memory was 115.9MB in the beginning and 99.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 151.0MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: 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 1568. 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] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE190_Integer_Overflow__int_rand_postinc_14_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalFive==5 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE globalFive==5 [L1559] 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] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 138 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-20 20:31:28,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_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 9cd8abd463896cab71131a4329cf3679cd4559f0c11b6170ba6b3a9c816efc8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:31:30,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:31:30,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 20:31:30,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:31:30,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:31:30,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 20:31:30,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:31:30,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:31:30,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:31:30,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:31:30,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:31:30,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:31:30,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:31:30,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:31:30,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:31:30,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:31:30,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:31:30,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:31:30,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:31:30,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:31:30,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:31:30,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:31:30,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 20:31:30,495 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 20:31:30,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:31:30,495 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:31:30,495 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 20:31:30,496 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:31:30,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:31:30,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:31:30,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:31:30,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:31:30,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:31:30,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:31:30,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:31:30,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:31:30,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:31:30,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:31:30,500 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 20:31:30,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 20:31:30,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:31:30,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:31:30,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:31:30,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:31:30,502 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 -> 9cd8abd463896cab71131a4329cf3679cd4559f0c11b6170ba6b3a9c816efc8a [2024-11-20 20:31:30,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:31:30,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:31:30,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:31:30,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:31:30,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:31:30,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:32,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:31:32,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:31:32,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:32,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348654d66/53b57b2b2c4e434eb44754c94be81b9f/FLAGbc0989a5f [2024-11-20 20:31:32,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348654d66/53b57b2b2c4e434eb44754c94be81b9f [2024-11-20 20:31:32,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:31:32,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:31:32,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:31:32,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:31:32,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:31:32,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:32" (1/1) ... [2024-11-20 20:31:33,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f6308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:33, skipping insertion in model container [2024-11-20 20:31:33,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:31:32" (1/1) ... [2024-11-20 20:31:33,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:31:33,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:31:33,973 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:31:34,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:31:34,191 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:31:34,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34 WrapperNode [2024-11-20 20:31:34,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:31:34,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:31:34,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:31:34,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:31:34,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,247 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-20 20:31:34,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:31:34,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:31:34,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:31:34,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:31:34,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,270 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:31:34,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:31:34,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:31:34,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:31:34,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:31:34,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (1/1) ... [2024-11-20 20:31:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:31:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:31:34,323 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-20 20:31:34,330 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-20 20:31:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:31:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:31:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:31:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:31:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:31:34,531 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:31:34,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:31:34,714 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-20 20:31:34,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:31:34,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:31:34,730 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:31:34,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:34 BoogieIcfgContainer [2024-11-20 20:31:34,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:31:34,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:31:34,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:31:34,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:31:34,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:31:32" (1/3) ... [2024-11-20 20:31:34,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e280844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:34, skipping insertion in model container [2024-11-20 20:31:34,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:31:34" (2/3) ... [2024-11-20 20:31:34,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e280844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:31:34, skipping insertion in model container [2024-11-20 20:31:34,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:34" (3/3) ... [2024-11-20 20:31:34,741 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_14_bad.i [2024-11-20 20:31:34,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:31:34,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:31:34,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:31:34,827 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;@25cf4c54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:31:34,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:31:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-20 20:31:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 20:31:34,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:34,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:34,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1654475935, now seen corresponding path program 1 times [2024-11-20 20:31:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:31:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879054451] [2024-11-20 20:31:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:34,857 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-20 20:31:34,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:31:34,858 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-20 20:31:34,860 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-20 20:31:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:34,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 20:31:35,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:31:35,026 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-20 20:31:35,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:31:35,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:31:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879054451] [2024-11-20 20:31:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879054451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:31:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:31:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 20:31:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334425827] [2024-11-20 20:31:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:31:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 20:31:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:31:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 20:31:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:31:35,061 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-20 20:31:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:31:35,076 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-20 20:31:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 20:31:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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 11 [2024-11-20 20:31:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:31:35,084 INFO L225 Difference]: With dead ends: 23 [2024-11-20 20:31:35,085 INFO L226 Difference]: Without dead ends: 15 [2024-11-20 20:31:35,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-20 20:31:35,091 INFO L432 NwaCegarLoop]: 26 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, 26 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-20 20:31:35,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:31:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-20 20:31:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-20 20:31:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 12 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-20 20:31:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-20 20:31:35,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-20 20:31:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:31:35,121 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-20 20:31:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-20 20:31:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-20 20:31:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 20:31:35,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:35,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:35,131 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-20 20:31:35,323 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-20 20:31:35,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:35,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -250853505, now seen corresponding path program 1 times [2024-11-20 20:31:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:31:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460830019] [2024-11-20 20:31:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:35,326 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-20 20:31:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:31:35,328 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-20 20:31:35,335 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-20 20:31:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:31:35,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 20:31:35,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:31:35,448 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-20 20:31:35,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:31:35,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:31:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460830019] [2024-11-20 20:31:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460830019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:31:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:31:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:31:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453145382] [2024-11-20 20:31:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:31:35,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:31:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:31:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:31:35,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:31:35,456 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:31:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:31:35,462 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-20 20:31:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:31:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 20:31:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:31:35,464 INFO L225 Difference]: With dead ends: 19 [2024-11-20 20:31:35,464 INFO L226 Difference]: Without dead ends: 15 [2024-11-20 20:31:35,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:31:35,466 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:31:35,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:31:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-20 20:31:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-20 20:31:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:31:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-20 20:31:35,474 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-20 20:31:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:31:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-20 20:31:35,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:31:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-20 20:31:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 20:31:35,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:31:35,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:31:35,482 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 20:31:35,681 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-20 20:31:35,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:31:35,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:31:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash -819187548, now seen corresponding path program 1 times [2024-11-20 20:31:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:31:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979652357] [2024-11-20 20:31:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:31:35,684 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-20 20:31:35,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:31:35,687 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-20 20:31:35,688 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-20 20:31:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:31:35,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:31:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:31:35,845 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 20:31:35,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:31:35,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:31:35,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:31:35,855 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-20 20:31:36,050 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-20 20:31:36,053 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 20:31:36,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:31:36,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:31:36 BoogieIcfgContainer [2024-11-20 20:31:36,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:31:36,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:31:36,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:31:36,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:31:36,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:31:34" (3/4) ... [2024-11-20 20:31:36,077 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:31:36,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:31:36,079 INFO L158 Benchmark]: Toolchain (without parser) took 3086.03ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 33.2MB in the end (delta: -2.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,079 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 50.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:31:36,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1198.35ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 47.9MB in the end (delta: -17.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 44.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,080 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 79.7MB. Free memory was 44.5MB in the beginning and 42.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,081 INFO L158 Benchmark]: RCFGBuilder took 444.07ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 49.3MB in the end (delta: -7.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,081 INFO L158 Benchmark]: TraceAbstraction took 1341.21ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 33.6MB in the end (delta: 14.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,082 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 79.7MB. Free memory was 33.6MB in the beginning and 33.2MB in the end (delta: 472.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:31:36,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 50.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1198.35ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 47.9MB in the end (delta: -17.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 44.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.73ms. Allocated memory is still 79.7MB. Free memory was 44.5MB in the beginning and 42.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.07ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 49.3MB in the end (delta: -7.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1341.21ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 33.6MB in the end (delta: 14.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 79.7MB. Free memory was 33.6MB in the beginning and 33.2MB in the end (delta: 472.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: 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 1568. 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] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE190_Integer_Overflow__int_rand_postinc_14_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalFive==5 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE globalFive==5 [L1559] 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] - UnprovableResult [Line: 1559]: 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, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:31:36,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample