./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex1.c -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 b7646a22882710466ec3244f9455a19a1dbe784d959581f36adf578939304de7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:10:45,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:10:45,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:10:45,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:10:45,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:10:45,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:10:45,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:10:45,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:10:45,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:10:45,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:10:45,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:10:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:10:45,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:10:45,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:10:45,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:10:45,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:10:45,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:10:45,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:10:45,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:10:45,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:10:45,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:10:45,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:10:45,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:10:45,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:10:45,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:10:45,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:10:45,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:10:45,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:10:45,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:10:45,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:10:45,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:10:45,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:10:45,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:10:45,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:10:45,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:10:45,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:10:45,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:10:45,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:10:45,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:10:45,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:10:45,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:10:45,388 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 -> b7646a22882710466ec3244f9455a19a1dbe784d959581f36adf578939304de7 [2024-11-19 10:10:45,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:10:45,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:10:45,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:10:45,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:10:45,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:10:45,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex1.c [2024-11-19 10:10:47,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:10:47,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:10:47,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex1.c [2024-11-19 10:10:47,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bc6578f/329214dc95cb42f784115c19a2c918c7/FLAG5761ad577 [2024-11-19 10:10:47,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bc6578f/329214dc95cb42f784115c19a2c918c7 [2024-11-19 10:10:47,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:10:47,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:10:47,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:10:47,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:10:47,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:10:47,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:47,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5111f5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47, skipping insertion in model container [2024-11-19 10:10:47,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:47,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:10:47,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:10:47,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:10:47,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:10:47,962 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:10:47,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47 WrapperNode [2024-11-19 10:10:47,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:10:47,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:10:47,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:10:47,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:10:47,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:47,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,023 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2024-11-19 10:10:48,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:10:48,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:10:48,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:10:48,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:10:48,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,037 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:10:48,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:10:48,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:10:48,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:10:48,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:10:48,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (1/1) ... [2024-11-19 10:10:48,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:10:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:10:48,109 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-19 10:10:48,112 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-19 10:10:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:10:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:10:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure r1 [2024-11-19 10:10:48,149 INFO L138 BoogieDeclarations]: Found implementation of procedure r1 [2024-11-19 10:10:48,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:10:48,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:10:48,325 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 10:10:48,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:10:48,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:10:48,337 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 10:10:48,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:48 BoogieIcfgContainer [2024-11-19 10:10:48,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:10:48,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:10:48,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:10:48,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:10:48,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:10:47" (1/3) ... [2024-11-19 10:10:48,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b2aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:10:48, skipping insertion in model container [2024-11-19 10:10:48,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:47" (2/3) ... [2024-11-19 10:10:48,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b2aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:10:48, skipping insertion in model container [2024-11-19 10:10:48,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:48" (3/3) ... [2024-11-19 10:10:48,346 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex1.c [2024-11-19 10:10:48,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:10:48,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 10:10:48,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:10:48,417 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;@4b8fb87a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:10:48,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 10:10:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:10:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:10:48,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:10:48,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:10:48,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting r1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [r1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 10:10:48,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:10:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1805805519, now seen corresponding path program 1 times [2024-11-19 10:10:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:10:48,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942110991] [2024-11-19 10:10:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:10:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:10:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:10:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:10:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:10:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942110991] [2024-11-19 10:10:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942110991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:10:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:10:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:10:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396388517] [2024-11-19 10:10:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:10:48,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:10:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:10:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:10:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:10:48,678 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:10:48,793 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-19 10:10:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:10:48,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 10:10:48,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:10:48,805 INFO L225 Difference]: With dead ends: 48 [2024-11-19 10:10:48,806 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 10:10:48,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:10:48,814 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:10:48,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 69 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:10:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 10:10:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2024-11-19 10:10:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-19 10:10:48,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 7 [2024-11-19 10:10:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:10:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-19 10:10:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-19 10:10:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:10:48,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:10:48,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:10:48,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:10:48,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting r1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [r1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 10:10:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:10:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 145396296, now seen corresponding path program 1 times [2024-11-19 10:10:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:10:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048173674] [2024-11-19 10:10:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:10:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:10:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:10:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:10:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:10:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048173674] [2024-11-19 10:10:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048173674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:10:48,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:10:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:10:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695153298] [2024-11-19 10:10:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:10:48,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:10:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:10:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:10:48,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:10:48,955 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:10:49,028 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-19 10:10:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:10:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:10:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:10:49,031 INFO L225 Difference]: With dead ends: 24 [2024-11-19 10:10:49,031 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 10:10:49,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:10:49,033 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:10:49,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:10:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 10:10:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 10:10:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-19 10:10:49,043 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 8 [2024-11-19 10:10:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:10:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-19 10:10:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:10:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-19 10:10:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:10:49,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:10:49,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:10:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:10:49,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting r1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [r1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, r1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-19 10:10:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:10:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2008078486, now seen corresponding path program 1 times [2024-11-19 10:10:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:10:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114105801] [2024-11-19 10:10:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:10:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:10:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:10:49,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:10:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:10:49,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:10:49,090 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:10:49,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location r1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 10:10:49,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location r1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 10:10:49,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location r1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 10:10:49,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location r1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 10:10:49,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location r1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 10:10:49,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location r1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 10:10:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:10:49,097 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 10:10:49,121 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:10:49,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:10:49 BoogieIcfgContainer [2024-11-19 10:10:49,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:10:49,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:10:49,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:10:49,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:10:49,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:48" (3/4) ... [2024-11-19 10:10:49,132 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:10:49,165 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:10:49,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:10:49,166 INFO L158 Benchmark]: Toolchain (without parser) took 1452.00ms. Allocated memory is still 163.6MB. Free memory was 111.8MB in the beginning and 81.3MB in the end (delta: 30.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,166 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 55.1MB in the beginning and 54.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:10:49,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.59ms. Allocated memory is still 163.6MB. Free memory was 111.8MB in the beginning and 134.7MB in the end (delta: -22.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 163.6MB. Free memory was 134.7MB in the beginning and 133.7MB in the end (delta: 987.0kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,167 INFO L158 Benchmark]: Boogie Preprocessor took 19.03ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 131.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:10:49,168 INFO L158 Benchmark]: RCFGBuilder took 293.97ms. Allocated memory is still 163.6MB. Free memory was 131.6MB in the beginning and 121.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,168 INFO L158 Benchmark]: TraceAbstraction took 790.12ms. Allocated memory is still 163.6MB. Free memory was 120.2MB in the beginning and 82.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,169 INFO L158 Benchmark]: Witness Printer took 34.73ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 81.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:10:49,170 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.18ms. Allocated memory is still 96.5MB. Free memory was 55.1MB in the beginning and 54.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.59ms. Allocated memory is still 163.6MB. Free memory was 111.8MB in the beginning and 134.7MB in the end (delta: -22.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 163.6MB. Free memory was 134.7MB in the beginning and 133.7MB in the end (delta: 987.0kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.03ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 131.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.97ms. Allocated memory is still 163.6MB. Free memory was 131.6MB in the beginning and 121.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 790.12ms. Allocated memory is still 163.6MB. Free memory was 120.2MB in the beginning and 82.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 34.73ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 81.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int ls = __VERIFIER_nondet_int(); [L27] COND TRUE ls >= 0 [L28] CALL rev(ls) [L22] CALL r1(ls,0) VAL [\old(a)=0, \old(ls)=2147483647] [L14] COND FALSE !(ls == 0) VAL [\old(a)=0, \old(ls)=2147483647, a=0, ls=2147483647] [L17] ls-1 VAL [\old(a)=0, \old(ls)=2147483647, a=0, ls=2147483647] [L17] ls+1 VAL [\old(a)=0, \old(ls)=2147483647, a=0] - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 21 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 33 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:10:49,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)