./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i --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-memory-alloca/b.03-no-inv_assume-alloca.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 b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 10:19:25,706 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-19 10:19:25,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf
[2024-11-19 10:19:25,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 10:19:25,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 10:19:25,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 10:19:25,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 10:19:25,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 10:19:25,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 10:19:25,822 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-19 10:19:25,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 10:19:25,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 10:19:25,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 10:19:25,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-19 10:19:25,826 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-19 10:19:25,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 10:19:25,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-19 10:19:25,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-19 10:19:25,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-19 10:19:25,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 10:19:25,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 10:19:25,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 10:19:25,831 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-19 10:19:25,831 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-19 10:19:25,831 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-19 10:19:25,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-19 10:19:25,832 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-19 10:19:25,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 10:19:25,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-19 10:19:25,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 10:19:25,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-19 10:19:25,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 10:19:25,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 10:19:25,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 10:19:25,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 10:19:25,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-19 10:19:25,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 10:19:25,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 10:19:25,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 10:19:25,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 10:19:25,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 10:19:25,835 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 -> b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869
[2024-11-19 10:19:26,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 10:19:26,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 10:19:26,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 10:19:26,182 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-19 10:19:26,183 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-19 10:19:26,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i
[2024-11-19 10:19:27,623 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-19 10:19:27,820 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-19 10:19:27,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i
[2024-11-19 10:19:27,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3944fbd37/f3819ed7aa9e4f2b9a621f80be11c084/FLAGe3b8670b2
[2024-11-19 10:19:27,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3944fbd37/f3819ed7aa9e4f2b9a621f80be11c084
[2024-11-19 10:19:27,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 10:19:27,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 10:19:27,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 10:19:27,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 10:19:27,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 10:19:27,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:27" (1/1) ...
[2024-11-19 10:19:27,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12346a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:27, skipping insertion in model container
[2024-11-19 10:19:27,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:19:27" (1/1) ...
[2024-11-19 10:19:27,903 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-19 10:19:28,221 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 10:19:28,231 INFO L200 MainTranslator]: Completed pre-run
[2024-11-19 10:19:28,276 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 10:19:28,303 INFO L204 MainTranslator]: Completed translation
[2024-11-19 10:19:28,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28 WrapperNode
[2024-11-19 10:19:28,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 10:19:28,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 10:19:28,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 10:19:28,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 10:19:28,313 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:19:28" (1/1) ...
[2024-11-19 10:19:28,326 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:19:28" (1/1) ...
[2024-11-19 10:19:28,348 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82
[2024-11-19 10:19:28,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 10:19:28,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 10:19:28,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 10:19:28,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 10:19:28,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,383 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [5, 7]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2].
[2024-11-19 10:19:28,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 10:19:28,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 10:19:28,401 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 10:19:28,401 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-19 10:19:28,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (1/1) ...
[2024-11-19 10:19:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 10:19:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:19:28,435 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:19:28,438 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:19:28,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-19 10:19:28,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-19 10:19:28,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-19 10:19:28,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-19 10:19:28,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-19 10:19:28,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-19 10:19:28,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 10:19:28,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 10:19:28,621 INFO L238 CfgBuilder]: Building ICFG
[2024-11-19 10:19:28,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 10:19:28,784 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2024-11-19 10:19:28,785 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-19 10:19:28,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 10:19:28,799 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 10:19:28,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:28 BoogieIcfgContainer
[2024-11-19 10:19:28,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 10:19:28,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 10:19:28,802 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 10:19:28,805 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-19 10:19:28,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:19:27" (1/3) ...
[2024-11-19 10:19:28,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0c262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:28, skipping insertion in model container
[2024-11-19 10:19:28,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:19:28" (2/3) ...
[2024-11-19 10:19:28,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0c262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:19:28, skipping insertion in model container
[2024-11-19 10:19:28,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:28" (3/3) ...
[2024-11-19 10:19:28,813 INFO L112 eAbstractionObserver]: Analyzing ICFG b.03-no-inv_assume-alloca.i
[2024-11-19 10:19:28,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 10:19:28,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-11-19 10:19:28,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 10:19:28,889 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;@23ac23f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 10:19:28,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-11-19 10:19:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-19 10:19:28,900 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:28,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:28,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:28,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 889571273, now seen corresponding path program 1 times
[2024-11-19 10:19:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342573237]
[2024-11-19 10:19:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:29,359 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:19:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342573237]
[2024-11-19 10:19:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342573237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:19:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:19:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 10:19:29,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815633874]
[2024-11-19 10:19:29,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:19:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 10:19:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 10:19:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:19:29,394 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:29,467 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions.
[2024-11-19 10:19:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-19 10:19:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-19 10:19:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:29,477 INFO L225 Difference]: With dead ends: 24
[2024-11-19 10:19:29,477 INFO L226 Difference]: Without dead ends: 13
[2024-11-19 10:19:29,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-19 10:19:29,484 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:19:29,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:19:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2024-11-19 10:19:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2024-11-19 10:19:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2024-11-19 10:19:29,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 6
[2024-11-19 10:19:29,513 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:29,513 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2024-11-19 10:19:29,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2024-11-19 10:19:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-19 10:19:29,514 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:29,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:29,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 10:19:29,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:29,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1806911822, now seen corresponding path program 1 times
[2024-11-19 10:19:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626218352]
[2024-11-19 10:19:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:29,562 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:19:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626218352]
[2024-11-19 10:19:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626218352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:19:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:19:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 10:19:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065793245]
[2024-11-19 10:19:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:19:29,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 10:19:29,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 10:19:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 10:19:29,570 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:29,584 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions.
[2024-11-19 10:19:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 10:19:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:19:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:29,585 INFO L225 Difference]: With dead ends: 24
[2024-11-19 10:19:29,586 INFO L226 Difference]: Without dead ends: 13
[2024-11-19 10:19:29,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 10:19:29,588 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 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-19 10:19:29,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:19:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2024-11-19 10:19:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2024-11-19 10:19:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2024-11-19 10:19:29,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7
[2024-11-19 10:19:29,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:29,594 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2024-11-19 10:19:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2024-11-19 10:19:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-19 10:19:29,595 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:29,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 10:19:29,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905736, now seen corresponding path program 1 times
[2024-11-19 10:19:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246675102]
[2024-11-19 10:19:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:29,796 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:19:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:29,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246675102]
[2024-11-19 10:19:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246675102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:19:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:19:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 10:19:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978764909]
[2024-11-19 10:19:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:19:29,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 10:19:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:29,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 10:19:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 10:19:29,802 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:29,844 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions.
[2024-11-19 10:19:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-19 10:19:29,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:19:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:29,846 INFO L225 Difference]: With dead ends: 13
[2024-11-19 10:19:29,847 INFO L226 Difference]: Without dead ends: 12
[2024-11-19 10:19:29,848 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:19:29,850 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:19:29,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:19:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states.
[2024-11-19 10:19:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2024-11-19 10:19:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2024-11-19 10:19:29,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7
[2024-11-19 10:19:29,862 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2024-11-19 10:19:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2024-11-19 10:19:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-19 10:19:29,866 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:29,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:29,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 10:19:29,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:29,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1269626538, now seen corresponding path program 1 times
[2024-11-19 10:19:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510276094]
[2024-11-19 10:19:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:30,117 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:19:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510276094]
[2024-11-19 10:19:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510276094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:19:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:19:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 10:19:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963529567]
[2024-11-19 10:19:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:19:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 10:19:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 10:19:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 10:19:30,120 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:30,179 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions.
[2024-11-19 10:19:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-19 10:19:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9
[2024-11-19 10:19:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:30,181 INFO L225 Difference]: With dead ends: 21
[2024-11-19 10:19:30,182 INFO L226 Difference]: Without dead ends: 20
[2024-11-19 10:19:30,182 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:19:30,183 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:19:30,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:19:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-11-19 10:19:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18.
[2024-11-19 10:19:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions.
[2024-11-19 10:19:30,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9
[2024-11-19 10:19:30,193 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:30,193 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions.
[2024-11-19 10:19:30,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions.
[2024-11-19 10:19:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-19 10:19:30,194 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:30,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:30,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 10:19:30,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:30,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 703717075, now seen corresponding path program 1 times
[2024-11-19 10:19:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69782264]
[2024-11-19 10:19:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:30,464 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:19:30,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69782264]
[2024-11-19 10:19:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69782264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:19:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:19:30,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 10:19:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712462454]
[2024-11-19 10:19:30,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:19:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 10:19:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 10:19:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 10:19:30,468 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:30,508 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions.
[2024-11-19 10:19:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-19 10:19:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-19 10:19:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:30,509 INFO L225 Difference]: With dead ends: 18
[2024-11-19 10:19:30,510 INFO L226 Difference]: Without dead ends: 17
[2024-11-19 10:19:30,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:19:30,511 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:19:30,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:19:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2024-11-19 10:19:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2024-11-19 10:19:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions.
[2024-11-19 10:19:30,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10
[2024-11-19 10:19:30,519 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:30,519 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions.
[2024-11-19 10:19:30,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions.
[2024-11-19 10:19:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-19 10:19:30,520 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 10:19:30,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:30,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 10:19:30,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-19 10:19:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:19:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1131283238, now seen corresponding path program 1 times
[2024-11-19 10:19:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:19:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290339722]
[2024-11-19 10:19:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:19:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:19:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:19:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290339722]
[2024-11-19 10:19:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290339722] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:19:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474214693]
[2024-11-19 10:19:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:19:30,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:19:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:19:30,820 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-19 10:19:30,822 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-19 10:19:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:19:30,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-19 10:19:30,918 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:19:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-19 10:19:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-11-19 10:19:31,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-19 10:19:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:19:31,147 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:19:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:19:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474214693] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:19:31,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:19:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-11-19 10:19:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977122804]
[2024-11-19 10:19:31,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:19:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-19 10:19:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:19:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-19 10:19:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2024-11-19 10:19:31,285 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:19:31,482 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions.
[2024-11-19 10:19:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-19 10:19:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2024-11-19 10:19:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:19:31,483 INFO L225 Difference]: With dead ends: 18
[2024-11-19 10:19:31,483 INFO L226 Difference]: Without dead ends: 0
[2024-11-19 10:19:31,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506
[2024-11-19 10:19:31,485 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:19:31,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:19:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-19 10:19:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-19 10:19:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-19 10:19:31,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16
[2024-11-19 10:19:31,486 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:19:31,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-19 10:19:31,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:19:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-19 10:19:31,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-19 10:19:31,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining)
[2024-11-19 10:19:31,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining)
[2024-11-19 10:19:31,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining)
[2024-11-19 10:19:31,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining)
[2024-11-19 10:19:31,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-19 10:19:31,694 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,SelfDestructingSolverStorable5
[2024-11-19 10:19:31,698 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-19 10:19:31,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-19 10:19:31,736 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 10:19:31,750 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2024-11-19 10:19:31,751 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2024-11-19 10:19:31,751 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2024-11-19 10:19:31,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2024-11-19 10:19:31,753 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-19 10:19:31,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:19:31 BoogieIcfgContainer
[2024-11-19 10:19:31,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 10:19:31,757 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 10:19:31,757 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-19 10:19:31,757 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-19 10:19:31,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:19:28" (3/4) ...
[2024-11-19 10:19:31,760 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-19 10:19:31,769 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-19 10:19:31,769 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-19 10:19:31,769 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2024-11-19 10:19:31,769 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-19 10:19:31,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-19 10:19:31,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-19 10:19:31,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 10:19:31,860 INFO L158 Benchmark]: Toolchain (without parser) took 4012.09ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 91.2MB in the beginning and 85.4MB in the end (delta: 5.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,861 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 132.1MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 10:19:31,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.91ms. Allocated memory is still 132.1MB. Free memory was 90.8MB in the beginning and 72.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.94ms. Allocated memory is still 132.1MB. Free memory was 72.7MB in the beginning and 70.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,862 INFO L158 Benchmark]: Boogie Preprocessor took 51.65ms. Allocated memory is still 132.1MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,862 INFO L158 Benchmark]: RCFGBuilder took 399.16ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 93.8MB in the end (delta: -25.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,862 INFO L158 Benchmark]: TraceAbstraction took 2954.41ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 93.2MB in the beginning and 90.6MB in the end (delta: 2.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,862 INFO L158 Benchmark]: Witness Printer took 103.06ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-19 10:19:31,864 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.15ms. Allocated memory is still 132.1MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 454.91ms. Allocated memory is still 132.1MB. Free memory was 90.8MB in the beginning and 72.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 42.94ms. Allocated memory is still 132.1MB. Free memory was 72.7MB in the beginning and 70.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 51.65ms. Allocated memory is still 132.1MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 399.16ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 93.8MB in the end (delta: -25.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 2954.41ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 93.2MB in the beginning and 90.6MB in the end (delta: 2.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB.
* Witness Printer took 103.06ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#1
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,<LOCAL,test_fun>]]]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
* 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
- PositiveResult [Line: 556]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 556]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 557]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 557]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 19 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 50 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 721 SizeOfPredicates, 8 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 5/18 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
- AllSpecificationsHoldResult: All specifications hold
4 specifications checked. All of them hold
- InvariantResult [Line: 556]: Loop Invariant
Derived loop invariant: null
RESULT: Ultimate proved your program to be correct!
[2024-11-19 10:19:31,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE