./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:01:36,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:01:37,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 20:01:37,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:01:37,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:01:37,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:01:37,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:01:37,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:01:37,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:01:37,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:01:37,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:01:37,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:01:37,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:01:37,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:01:37,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:01:37,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:01:37,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:01:37,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:01:37,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:01:37,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:01:37,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:01:37,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:01:37,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:01:37,103 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:01:37,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:01:37,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:01:37,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:01:37,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:01:37,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:01:37,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:01:37,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:01:37,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:01:37,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:01:37,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:01:37,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:01:37,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:01:37,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:01:37,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:01:37,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:01:37,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:01:37,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:01:37,109 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 -> dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 [2024-11-12 20:01:37,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:01:37,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:01:37,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:01:37,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:01:37,370 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:01:37,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:38,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:01:39,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:01:39,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:39,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774de56df/ee1265223c8341d781092a4bdbb88b26/FLAG09896a1a0 [2024-11-12 20:01:39,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774de56df/ee1265223c8341d781092a4bdbb88b26 [2024-11-12 20:01:39,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:01:39,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:01:39,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:01:39,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:01:39,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:01:39,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:01:39" (1/1) ... [2024-11-12 20:01:39,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c66de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:39, skipping insertion in model container [2024-11-12 20:01:39,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:01:39" (1/1) ... [2024-11-12 20:01:39,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:01:39,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:01:39,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:01:40,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:01:40,169 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:01:40,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40 WrapperNode [2024-11-12 20:01:40,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:01:40,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:01:40,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:01:40,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:01:40,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,247 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2024-11-12 20:01:40,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:01:40,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:01:40,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:01:40,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:01:40,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,277 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 20:01:40,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:01:40,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:01:40,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:01:40,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:01:40,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (1/1) ... [2024-11-12 20:01:40,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:01:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:01:40,343 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-12 20:01:40,346 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-12 20:01:40,392 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 20:01:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 20:01:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-12 20:01:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-12 20:01:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:01:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:01:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:01:40,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:01:40,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:01:40,824 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-12 20:01:40,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:01:40,840 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:01:40,841 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 20:01:40,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:40 BoogieIcfgContainer [2024-11-12 20:01:40,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:01:40,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:01:40,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:01:40,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:01:40,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:01:39" (1/3) ... [2024-11-12 20:01:40,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed494ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:01:40, skipping insertion in model container [2024-11-12 20:01:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:40" (2/3) ... [2024-11-12 20:01:40,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed494ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:01:40, skipping insertion in model container [2024-11-12 20:01:40,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:40" (3/3) ... [2024-11-12 20:01:40,851 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:40,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:01:40,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 20:01:40,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:01:40,943 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;@526ab6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:01:40,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 20:01:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 20:01:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 20:01:40,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:40,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:40,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:40,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1648115636, now seen corresponding path program 1 times [2024-11-12 20:01:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:01:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919643913] [2024-11-12 20:01:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:01:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 20:01:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 20:01:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 20:01:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:01:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:01:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919643913] [2024-11-12 20:01:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919643913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:01:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626564430] [2024-11-12 20:01:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:01:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:01:41,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:01:41,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:01:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:41,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:01:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:01:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 20:01:41,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:01:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626564430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:01:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:01:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 20:01:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2270125] [2024-11-12 20:01:41,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:01:41,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:01:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:01:41,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:01:41,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:01:41,643 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:01:41,686 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-12 20:01:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:01:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-12 20:01:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:01:41,697 INFO L225 Difference]: With dead ends: 57 [2024-11-12 20:01:41,697 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 20:01:41,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:01:41,704 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:01:41,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:01:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 20:01:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-12 20:01:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 20:01:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-12 20:01:41,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-12 20:01:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:01:41,752 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-12 20:01:41,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-12 20:01:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 20:01:41,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:41,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:41,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 20:01:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-12 20:01:41,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash -448022698, now seen corresponding path program 1 times [2024-11-12 20:01:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:01:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828746664] [2024-11-12 20:01:41,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:01:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 20:01:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 20:01:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 20:01:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:01:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:01:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828746664] [2024-11-12 20:01:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828746664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:01:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249873904] [2024-11-12 20:01:42,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:42,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:01:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:01:42,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:01:42,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:01:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:01:42,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:01:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 20:01:42,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:01:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249873904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:01:42,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:01:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 20:01:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921338975] [2024-11-12 20:01:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:01:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:01:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:01:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:01:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:01:42,199 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:01:42,214 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-12 20:01:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:01:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-12 20:01:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:01:42,217 INFO L225 Difference]: With dead ends: 49 [2024-11-12 20:01:42,218 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 20:01:42,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:01:42,219 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:01:42,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:01:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 20:01:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 20:01:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 20:01:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-12 20:01:42,229 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-12 20:01:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:01:42,230 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-12 20:01:42,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-12 20:01:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 20:01:42,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:42,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:42,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:01:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-12 20:01:42,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash 10447351, now seen corresponding path program 1 times [2024-11-12 20:01:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:01:42,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671439680] [2024-11-12 20:01:42,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:01:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 20:01:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 20:01:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 20:01:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 20:01:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:01:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671439680] [2024-11-12 20:01:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671439680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:01:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:01:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:01:42,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023922341] [2024-11-12 20:01:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:01:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:01:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:01:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:01:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:01:42,695 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:01:42,790 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-12 20:01:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:01:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-12 20:01:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:01:42,792 INFO L225 Difference]: With dead ends: 51 [2024-11-12 20:01:42,792 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 20:01:42,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:01:42,794 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:01:42,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:01:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 20:01:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-12 20:01:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 20:01:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-12 20:01:42,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 27 [2024-11-12 20:01:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:01:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-12 20:01:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-12 20:01:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 20:01:42,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:42,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:42,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:01:42,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:42,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash -344802659, now seen corresponding path program 1 times [2024-11-12 20:01:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:01:42,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248253709] [2024-11-12 20:01:42,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:01:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:01:42,828 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:01:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:01:42,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:01:42,861 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 20:01:42,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 20:01:42,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 20:01:42,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:01:42,868 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 20:01:42,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 20:01:42,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:01:42 BoogieIcfgContainer [2024-11-12 20:01:42,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 20:01:42,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:01:42,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:01:42,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:01:42,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:40" (3/4) ... [2024-11-12 20:01:42,916 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:01:42,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:01:42,918 INFO L158 Benchmark]: Toolchain (without parser) took 3774.19ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 82.2MB in the beginning and 87.7MB in the end (delta: -5.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,919 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:01:42,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1024.84ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 82.0MB in the beginning and 128.4MB in the end (delta: -46.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.91ms. Allocated memory is still 211.8MB. Free memory was 128.4MB in the beginning and 125.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,920 INFO L158 Benchmark]: Boogie Preprocessor took 54.40ms. Allocated memory is still 211.8MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,920 INFO L158 Benchmark]: RCFGBuilder took 536.12ms. Allocated memory is still 211.8MB. Free memory was 123.2MB in the beginning and 105.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,920 INFO L158 Benchmark]: TraceAbstraction took 2067.32ms. Allocated memory is still 211.8MB. Free memory was 104.3MB in the beginning and 87.7MB in the end (delta: 16.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-12 20:01:42,920 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 211.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:01:42,922 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.24ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1024.84ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 82.0MB in the beginning and 128.4MB in the end (delta: -46.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.91ms. Allocated memory is still 211.8MB. Free memory was 128.4MB in the beginning and 125.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.40ms. Allocated memory is still 211.8MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.12ms. Allocated memory is still 211.8MB. Free memory was 123.2MB in the beginning and 105.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2067.32ms. Allocated memory is still 211.8MB. Free memory was 104.3MB in the beginning and 87.7MB in the end (delta: 16.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 5.63ms. Allocated memory is still 211.8MB. Free memory is still 87.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 CWE191_Integer_Underflow__int_rand_predec_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [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 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 172 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 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-12 20:01:42,949 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_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 dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:01:45,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:01:45,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 20:01:45,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:01:45,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:01:45,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 20:01:45,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:01:45,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:01:45,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:01:45,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:01:45,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:01:45,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:01:45,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:01:45,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:01:45,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:01:45,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:01:45,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:01:45,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:01:45,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:01:45,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:01:45,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:01:45,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:01:45,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 20:01:45,281 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 20:01:45,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:01:45,282 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:01:45,282 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 20:01:45,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:01:45,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:01:45,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:01:45,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:01:45,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:01:45,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:01:45,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:01:45,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:01:45,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:01:45,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:01:45,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:01:45,286 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 20:01:45,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 20:01:45,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:01:45,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:01:45,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:01:45,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:01:45,288 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 -> dbe2ca349e0667d8692126dce502d970e06290e62c46f46043e6bad80040db74 [2024-11-12 20:01:45,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:01:45,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:01:45,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:01:45,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:01:45,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:01:45,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:47,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:01:47,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:01:47,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:47,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae9e5dd1/a0b763febeb04f6bbd45b4d958ccc876/FLAG7e2989e3f [2024-11-12 20:01:47,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae9e5dd1/a0b763febeb04f6bbd45b4d958ccc876 [2024-11-12 20:01:47,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:01:47,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:01:47,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:01:47,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:01:47,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:01:47,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:01:47" (1/1) ... [2024-11-12 20:01:47,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4a7656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:47, skipping insertion in model container [2024-11-12 20:01:47,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:01:47" (1/1) ... [2024-11-12 20:01:47,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:01:48,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:01:48,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:01:48,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:01:48,896 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:01:48,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48 WrapperNode [2024-11-12 20:01:48,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:01:48,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:01:48,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:01:48,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:01:48,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,957 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-12 20:01:48,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:01:48,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:01:48,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:01:48,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:01:48,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,986 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 20:01:48,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:48,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:49,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:49,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:01:49,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:01:49,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:01:49,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:01:49,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (1/1) ... [2024-11-12 20:01:49,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:01:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:01:49,035 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-12 20:01:49,038 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-12 20:01:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 20:01:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 20:01:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-12 20:01:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-12 20:01:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:01:49,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:01:49,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:01:49,212 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:01:49,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:01:49,351 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 20:01:49,351 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:01:49,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:01:49,364 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 20:01:49,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:49 BoogieIcfgContainer [2024-11-12 20:01:49,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:01:49,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:01:49,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:01:49,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:01:49,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:01:47" (1/3) ... [2024-11-12 20:01:49,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4c106f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:01:49, skipping insertion in model container [2024-11-12 20:01:49,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:01:48" (2/3) ... [2024-11-12 20:01:49,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4c106f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:01:49, skipping insertion in model container [2024-11-12 20:01:49,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:49" (3/3) ... [2024-11-12 20:01:49,372 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_11_bad.i [2024-11-12 20:01:49,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:01:49,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 20:01:49,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:01:49,454 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;@54862dfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:01:49,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 20:01:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 20:01:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 20:01:49,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:49,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:49,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -894708504, now seen corresponding path program 1 times [2024-11-12 20:01:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:01:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677018898] [2024-11-12 20:01:49,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:49,490 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-12 20:01:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:01:49,493 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-12 20:01:49,494 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-12 20:01:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:01:49,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:01:49,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:01:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:01:49,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:01:49,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:01:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677018898] [2024-11-12 20:01:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677018898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:01:49,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:01:49,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:01:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941491402] [2024-11-12 20:01:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:01:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:01:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:01:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:01:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:01:49,750 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:01:49,790 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-12 20:01:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:01:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-12 20:01:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:01:49,798 INFO L225 Difference]: With dead ends: 47 [2024-11-12 20:01:49,799 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 20:01:49,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-12 20:01:49,804 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:01:49,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:01:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 20:01:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-12 20:01:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 20:01:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-12 20:01:49,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 19 [2024-11-12 20:01:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:01:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-12 20:01:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:01:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-12 20:01:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 20:01:49,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:01:49,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:01:49,850 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-12 20:01:50,047 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-12 20:01:50,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 20:01:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:01:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2082070403, now seen corresponding path program 1 times [2024-11-12 20:01:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:01:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534154767] [2024-11-12 20:01:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:01:50,051 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-12 20:01:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:01:50,055 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-12 20:01:50,056 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-12 20:01:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:01:50,148 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:01:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:01:50,230 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 20:01:50,230 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 20:01:50,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 20:01:50,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 20:01:50,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 20:01:50,438 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-12 20:01:50,441 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 20:01:50,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 20:01:50,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:01:50 BoogieIcfgContainer [2024-11-12 20:01:50,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 20:01:50,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:01:50,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:01:50,529 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:01:50,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:01:49" (3/4) ... [2024-11-12 20:01:50,532 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:01:50,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:01:50,535 INFO L158 Benchmark]: Toolchain (without parser) took 2766.98ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 34.7MB in the beginning and 52.9MB in the end (delta: -18.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,536 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 44.0MB. Free memory is still 20.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:01:50,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1128.51ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 23.9MB in the end (delta: 10.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 69.2MB. Free memory was 23.9MB in the beginning and 39.8MB in the end (delta: -15.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,538 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,538 INFO L158 Benchmark]: RCFGBuilder took 358.89ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 40.0MB in the end (delta: -2.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,539 INFO L158 Benchmark]: TraceAbstraction took 1161.88ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 53.0MB in the end (delta: -13.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-12 20:01:50,540 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 123.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:01:50,543 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.03ms. Allocated memory is still 44.0MB. Free memory is still 20.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1128.51ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 23.9MB in the end (delta: 10.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 69.2MB. Free memory was 23.9MB in the beginning and 39.8MB in the end (delta: -15.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.89ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 40.0MB in the end (delta: -2.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1161.88ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 53.0MB in the end (delta: -13.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 123.6kB). 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 CWE191_Integer_Underflow__int_rand_predec_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [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 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 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-12 20:01:50,583 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