/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/array-2.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 08:59:28,416 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 08:59:28,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 08:59:28,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 08:59:28,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 08:59:28,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 08:59:28,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 08:59:28,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 08:59:28,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 08:59:28,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 08:59:28,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 08:59:28,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 08:59:28,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 08:59:28,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 08:59:28,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 08:59:28,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 08:59:28,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 08:59:28,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 08:59:28,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 08:59:28,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 08:59:28,481 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 08:59:28,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 08:59:28,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 08:59:28,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 08:59:28,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 08:59:28,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 08:59:28,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 08:59:28,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 08:59:28,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 08:59:28,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 08:59:28,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 08:59:28,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 08:59:28,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 08:59:28,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 08:59:28,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 08:59:28,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 08:59:28,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 08:59:28,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 08:59:28,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 08:59:28,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 08:59:28,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 08:59:28,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 08:59:28,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 08:59:28,517 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 08:59:28,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 08:59:28,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 08:59:28,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 08:59:28,520 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 08:59:28,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 08:59:28,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:59:28,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 08:59:28,521 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 08:59:28,522 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 08:59:28,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 08:59:28,522 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 08:59:28,522 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 08:59:28,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 08:59:28,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 08:59:28,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 08:59:28,777 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 08:59:28,778 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 08:59:28,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-2.c
[2022-04-08 08:59:28,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b947a98/f353f0510edf43358bdcdd504f853466/FLAG966fb83ac
[2022-04-08 08:59:29,139 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 08:59:29,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c
[2022-04-08 08:59:29,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b947a98/f353f0510edf43358bdcdd504f853466/FLAG966fb83ac
[2022-04-08 08:59:29,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b947a98/f353f0510edf43358bdcdd504f853466
[2022-04-08 08:59:29,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 08:59:29,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 08:59:29,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 08:59:29,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 08:59:29,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 08:59:29,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dabef9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29, skipping insertion in model container
[2022-04-08 08:59:29,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 08:59:29,604 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 08:59:29,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c[319,332]
[2022-04-08 08:59:29,762 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:59:29,769 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 08:59:29,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c[319,332]
[2022-04-08 08:59:29,785 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:59:29,797 INFO L208 MainTranslator]: Completed translation
[2022-04-08 08:59:29,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29 WrapperNode
[2022-04-08 08:59:29,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 08:59:29,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 08:59:29,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 08:59:29,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 08:59:29,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 08:59:29,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 08:59:29,844 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 08:59:29,844 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 08:59:29,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ...
[2022-04-08 08:59:29,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:59:29,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:59:29,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 08:59:29,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 08:59:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 08:59:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 08:59:29,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 08:59:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 08:59:29,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 08:59:29,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 08:59:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 08:59:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 08:59:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 08:59:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 08:59:29,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 08:59:29,945 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 08:59:29,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-04-08 08:59:29,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 08:59:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 08:59:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 08:59:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 08:59:29,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 08:59:29,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 08:59:30,008 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 08:59:30,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 08:59:30,139 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 08:59:30,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 08:59:30,146 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 08:59:30,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:30 BoogieIcfgContainer
[2022-04-08 08:59:30,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 08:59:30,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 08:59:30,149 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 08:59:30,175 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 08:59:30,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:29" (1/3) ...
[2022-04-08 08:59:30,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:30, skipping insertion in model container
[2022-04-08 08:59:30,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (2/3) ...
[2022-04-08 08:59:30,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:30, skipping insertion in model container
[2022-04-08 08:59:30,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:30" (3/3) ...
[2022-04-08 08:59:30,178 INFO L111 eAbstractionObserver]: Analyzing ICFG array-2.c
[2022-04-08 08:59:30,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 08:59:30,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 08:59:30,258 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 08:59:30,263 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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
[2022-04-08 08:59:30,264 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 08:59:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 08:59:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-08 08:59:30,288 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:59:30,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:59:30,289 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:59:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:59:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 1 times
[2022-04-08 08:59:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:59:30,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717810494]
[2022-04-08 08:59:30,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:59:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 2 times
[2022-04-08 08:59:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:59:30,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569090518]
[2022-04-08 08:59:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:59:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:59:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:59:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 08:59:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:59:30,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID
[2022-04-08 08:59:30,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-08 08:59:30,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID
[2022-04-08 08:59:30,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 08:59:30,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID
[2022-04-08 08:59:30,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-08 08:59:30,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID
[2022-04-08 08:59:30,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret10 := main(); {25#true} is VALID
[2022-04-08 08:59:30,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {25#true} is VALID
[2022-04-08 08:59:30,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID
[2022-04-08 08:59:30,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {26#false} is VALID
[2022-04-08 08:59:30,575 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem9 > ~menor~0 then 1 else 0)); {26#false} is VALID
[2022-04-08 08:59:30,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID
[2022-04-08 08:59:30,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID
[2022-04-08 08:59:30,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID
[2022-04-08 08:59:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:59:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:59:30,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569090518]
[2022-04-08 08:59:30,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569090518] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:59:30,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:59:30,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:59:30,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:59:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717810494]
[2022-04-08 08:59:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717810494] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:59:30,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:59:30,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:59:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764549121]
[2022-04-08 08:59:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:59:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 08:59:30,591 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:59:30,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:30,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 08:59:30,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:59:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 08:59:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 08:59:30,652 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:30,761 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions.
[2022-04-08 08:59:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 08:59:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 08:59:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:59:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions.
[2022-04-08 08:59:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions.
[2022-04-08 08:59:30,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions.
[2022-04-08 08:59:30,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:30,856 INFO L225 Difference]: With dead ends: 35
[2022-04-08 08:59:30,856 INFO L226 Difference]: Without dead ends: 15
[2022-04-08 08:59:30,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 08:59:30,875 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:59:30,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:59:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2022-04-08 08:59:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2022-04-08 08:59:30,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:59:30,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,907 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,908 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:30,910 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions.
[2022-04-08 08:59:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2022-04-08 08:59:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:59:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:59:30,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states.
[2022-04-08 08:59:30,912 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states.
[2022-04-08 08:59:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:30,914 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions.
[2022-04-08 08:59:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2022-04-08 08:59:30,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:59:30,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:59:30,915 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:59:30,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:59:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2022-04-08 08:59:30,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12
[2022-04-08 08:59:30,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:59:30,918 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions.
[2022-04-08 08:59:30,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:30,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions.
[2022-04-08 08:59:30,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2022-04-08 08:59:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-08 08:59:30,937 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:59:30,937 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:59:30,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 08:59:30,938 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:59:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:59:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 1 times
[2022-04-08 08:59:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:59:30,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504601262]
[2022-04-08 08:59:30,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:59:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 2 times
[2022-04-08 08:59:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:59:30,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026312822]
[2022-04-08 08:59:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:59:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:59:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:59:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 08:59:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:59:31,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID
[2022-04-08 08:59:31,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID
[2022-04-08 08:59:31,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID
[2022-04-08 08:59:31,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 08:59:31,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID
[2022-04-08 08:59:31,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID
[2022-04-08 08:59:31,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID
[2022-04-08 08:59:31,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret10 := main(); {163#true} is VALID
[2022-04-08 08:59:31,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (~SIZE~0 % 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {168#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID
[2022-04-08 08:59:31,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {164#false} is VALID
[2022-04-08 08:59:31,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {164#false} is VALID
[2022-04-08 08:59:31,079 INFO L272 TraceCheckUtils]: 8: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem9 > ~menor~0 then 1 else 0)); {164#false} is VALID
[2022-04-08 08:59:31,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID
[2022-04-08 08:59:31,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID
[2022-04-08 08:59:31,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} assume !false; {164#false} is VALID
[2022-04-08 08:59:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:59:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:59:31,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026312822]
[2022-04-08 08:59:31,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026312822] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:59:31,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:59:31,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 08:59:31,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:59:31,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504601262]
[2022-04-08 08:59:31,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504601262] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:59:31,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:59:31,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 08:59:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859803874]
[2022-04-08 08:59:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:59:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 08:59:31,083 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:59:31,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:31,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 08:59:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:59:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 08:59:31,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 08:59:31,096 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:31,188 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions.
[2022-04-08 08:59:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 08:59:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 08:59:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:59:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions.
[2022-04-08 08:59:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions.
[2022-04-08 08:59:31,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions.
[2022-04-08 08:59:31,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:31,230 INFO L225 Difference]: With dead ends: 24
[2022-04-08 08:59:31,231 INFO L226 Difference]: Without dead ends: 18
[2022-04-08 08:59:31,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 08:59:31,235 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:59:31,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:59:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2022-04-08 08:59:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16.
[2022-04-08 08:59:31,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:59:31,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,255 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,255 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:31,259 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-08 08:59:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-08 08:59:31,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:59:31,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:59:31,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states.
[2022-04-08 08:59:31,260 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states.
[2022-04-08 08:59:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:59:31,262 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-08 08:59:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-08 08:59:31,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:59:31,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:59:31,265 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:59:31,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:59:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions.
[2022-04-08 08:59:31,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12
[2022-04-08 08:59:31,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:59:31,267 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions.
[2022-04-08 08:59:31,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 08:59:31,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions.
[2022-04-08 08:59:31,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:59:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-08 08:59:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-08 08:59:31,290 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:59:31,290 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:59:31,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 08:59:31,291 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:59:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:59:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 1 times
[2022-04-08 08:59:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:59:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413435628]
[2022-04-08 08:59:31,319 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays.
[2022-04-08 08:59:31,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 08:59:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 2 times
[2022-04-08 08:59:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:59:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366315136]
[2022-04-08 08:59:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:59:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:59:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 08:59:31,361 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-08 08:59:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 08:59:31,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-08 08:59:31,408 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-08 08:59:31,408 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-08 08:59:31,411 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 08:59:31,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 08:59:31,420 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2]
[2022-04-08 08:59:31,423 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 08:59:31,434 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 08:59:31,436 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-08 08:59:31,436 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 08:59:31,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 08:59:31,439 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation
[2022-04-08 08:59:31,440 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation
[2022-04-08 08:59:31,441 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 08:59:31,441 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 08:59:31,441 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation
[2022-04-08 08:59:31,441 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation
[2022-04-08 08:59:31,441 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation
[2022-04-08 08:59:31,459 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 08:59:31,459 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 08:59:31,459 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation
[2022-04-08 08:59:31,459 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-08 08:59:31,459 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-08 08:59:31,460 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation
[2022-04-08 08:59:31,460 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 08:59:31,460 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-08 08:59:31,460 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 08:59:31,460 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 08:59:31,460 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 08:59:31,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:59:31 BoogieIcfgContainer
[2022-04-08 08:59:31,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 08:59:31,481 INFO L158 Benchmark]: Toolchain (without parser) took 1906.88ms. Allocated memory was 187.7MB in the beginning and 247.5MB in the end (delta: 59.8MB). Free memory was 137.3MB in the beginning and 224.9MB in the end (delta: -87.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB.
[2022-04-08 08:59:31,481 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 187.7MB. Free memory was 153.5MB in the beginning and 153.5MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 08:59:31,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.60ms. Allocated memory was 187.7MB in the beginning and 247.5MB in the end (delta: 59.8MB). Free memory was 137.1MB in the beginning and 224.5MB in the end (delta: -87.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB.
[2022-04-08 08:59:31,482 INFO L158 Benchmark]: Boogie Preprocessor took 41.65ms. Allocated memory is still 247.5MB. Free memory was 224.5MB in the beginning and 223.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 08:59:31,482 INFO L158 Benchmark]: RCFGBuilder took 305.54ms. Allocated memory is still 247.5MB. Free memory was 222.7MB in the beginning and 210.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2022-04-08 08:59:31,482 INFO L158 Benchmark]: TraceAbstraction took 1330.60ms. Allocated memory is still 247.5MB. Free memory was 210.1MB in the beginning and 225.2MB in the end (delta: -15.1MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB.
[2022-04-08 08:59:31,484 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.21ms. Allocated memory is still 187.7MB. Free memory was 153.5MB in the beginning and 153.5MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 220.60ms. Allocated memory was 187.7MB in the beginning and 247.5MB in the end (delta: 59.8MB). Free memory was 137.1MB in the beginning and 224.5MB in the end (delta: -87.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 41.65ms. Allocated memory is still 247.5MB. Free memory was 224.5MB in the beginning and 223.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 305.54ms. Allocated memory is still 247.5MB. Free memory was 222.7MB in the beginning and 210.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
* TraceAbstraction took 1330.60ms. Allocated memory is still 247.5MB. Free memory was 210.1MB in the beginning and 225.2MB in the end (delta: -15.1MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB.
* 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: 7]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L15] unsigned int SIZE=1;
[L16] unsigned int j,k;
[L17] int array[SIZE], menor;
[L19] menor = __VERIFIER_nondet_int()
[L21] j=0
[L21] COND TRUE j<SIZE
[L22] array[j] = __VERIFIER_nondet_int()
[L24] EXPR array[j]
[L24] COND TRUE array[j]<=menor
[L25] EXPR array[j]
[L25] menor = array[j]
[L21] j++
[L21] COND FALSE !(j<SIZE)
[L28] EXPR array[0]
[L28] CALL __VERIFIER_assert(array[0]>menor)
[L6] COND TRUE !(cond)
[L7] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 35 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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!
[2022-04-08 08:59:31,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...