/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/loop-acceleration/array_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:12:33,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:12:33,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:12:33,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:12:33,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:12:33,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:12:33,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:12:33,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:12:33,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:12:33,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:12:33,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:12:33,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:12:33,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:12:33,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:12:33,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:12:33,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:12:33,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:12:33,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:12:33,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:12:33,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:12:33,310 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:12:33,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:12:33,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:12:33,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:12:33,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:12:33,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:12:33,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:12:33,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:12:33,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:12:33,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:12:33,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:12:33,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:12:33,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:12:33,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:12:33,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:12:33,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:12:33,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:12:33,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:12:33,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:12:33,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:12:33,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:12:33,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:12:33,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:12:33,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:12:33,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:12:33,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:12:33,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:12:33,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:12:33,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:12:33,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:12:33,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:12:33,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:12:33,336 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:12:33,336 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-28 09:12:33,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:12:33,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:12:33,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:12:33,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:12:33,532 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:12:33,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-2.c [2022-04-28 09:12:33,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4659f512b/d32833d425db4c65a32d4f7c2d6319e3/FLAGa279d8b5e [2022-04-28 09:12:33,919 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:12:33,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c [2022-04-28 09:12:33,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4659f512b/d32833d425db4c65a32d4f7c2d6319e3/FLAGa279d8b5e [2022-04-28 09:12:33,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4659f512b/d32833d425db4c65a32d4f7c2d6319e3 [2022-04-28 09:12:33,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:12:33,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:12:33,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:12:33,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:12:33,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:12:33,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:12:33" (1/1) ... [2022-04-28 09:12:33,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce091c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:33, skipping insertion in model container [2022-04-28 09:12:33,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:12:33" (1/1) ... [2022-04-28 09:12:33,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:12:33,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:12:34,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c[321,334] [2022-04-28 09:12:34,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:12:34,098 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:12:34,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c[321,334] [2022-04-28 09:12:34,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:12:34,119 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:12:34,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34 WrapperNode [2022-04-28 09:12:34,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:12:34,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:12:34,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:12:34,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:12:34,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:12:34,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:12:34,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:12:34,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:12:34,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (1/1) ... [2022-04-28 09:12:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:12:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:34,179 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-28 09:12:34,189 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-28 09:12:34,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:12:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:12:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:12:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:12:34,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:12:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:12:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:12:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:12:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:12:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:12:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:12:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:12:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:12:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:12:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:12:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:12:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:12:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:12:34,259 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:12:34,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:12:34,335 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:12:34,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:12:34,340 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:12:34,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:34 BoogieIcfgContainer [2022-04-28 09:12:34,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:12:34,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:12:34,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:12:34,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:12:34,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:12:33" (1/3) ... [2022-04-28 09:12:34,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10767daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:12:34, skipping insertion in model container [2022-04-28 09:12:34,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:34" (2/3) ... [2022-04-28 09:12:34,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10767daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:12:34, skipping insertion in model container [2022-04-28 09:12:34,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:34" (3/3) ... [2022-04-28 09:12:34,360 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-2.c [2022-04-28 09:12:34,369 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:12:34,370 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:12:34,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:12:34,424 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5081a6c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31327c10 [2022-04-28 09:12:34,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:12:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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-28 09:12:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:12:34,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:34,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:34,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:34,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 1 times [2022-04-28 09:12:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:34,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607774532] [2022-04-28 09:12:34,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:12:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 2 times [2022-04-28 09:12:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254770877] [2022-04-28 09:12:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:34,685 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(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 09:12:34,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 09:12:34,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 09:12:34,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:34,687 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(12, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 09:12:34,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 09:12:34,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 09:12:34,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 09:12:34,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {29#(= main_~i~0 0)} is VALID [2022-04-28 09:12:34,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < 1024); {25#false} is VALID [2022-04-28 09:12:34,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2022-04-28 09:12:34,689 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {25#false} is VALID [2022-04-28 09:12:34,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 09:12:34,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 09:12:34,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 09:12:34,690 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-28 09:12:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254770877] [2022-04-28 09:12:34,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254770877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:34,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:34,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:12:34,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:34,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607774532] [2022-04-28 09:12:34,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607774532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:34,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:12:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187499574] [2022-04-28 09:12:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:34,698 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-28 09:12:34,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:34,702 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-28 09:12:34,714 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-28 09:12:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:12:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:12:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:12:34,730 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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 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-28 09:12:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:34,850 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 09:12:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:12:34,851 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-28 09:12:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:34,852 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-28 09:12:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 09:12:34,857 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-28 09:12:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 09:12:34,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 09:12:34,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:34,905 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:12:34,905 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:12:34,907 INFO L412 NwaCegarLoop]: 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-28 09:12:34,910 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:34,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:12:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 09:12:34,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:34,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 09:12:34,930 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 09:12:34,931 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 09:12:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:34,932 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:12:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:12:34,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:34,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:34,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states. [2022-04-28 09:12:34,933 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states. [2022-04-28 09:12:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:34,935 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:12:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:12:34,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:34,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:34,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:34,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 09:12:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:12:34,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 09:12:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:34,938 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:12:34,938 INFO L496 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-28 09:12:34,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:12:34,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:12:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:12:34,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:34,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:34,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:12:34,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 1 times [2022-04-28 09:12:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:34,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992363852] [2022-04-28 09:12:34,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:34,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 2 times [2022-04-28 09:12:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539706535] [2022-04-28 09:12:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 09:12:35,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:12:35,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 09:12:35,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:35,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 09:12:35,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:12:35,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 09:12:35,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 09:12:35,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {174#(= main_~i~0 0)} is VALID [2022-04-28 09:12:35,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {174#(= main_~i~0 0)} is VALID [2022-04-28 09:12:35,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 09:12:35,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 09:12:35,042 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 09:12:35,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 09:12:35,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 09:12:35,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 09:12:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539706535] [2022-04-28 09:12:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539706535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498775937] [2022-04-28 09:12:35,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:12:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:35,049 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) [2022-04-28 09:12:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:12:35,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:12:35,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:35,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 09:12:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:35,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 09:12:35,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 09:12:35,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:12:35,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 09:12:35,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 09:12:35,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {195#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:35,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {195#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:35,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {175#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 09:12:35,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 09:12:35,183 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 09:12:35,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 09:12:35,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 09:12:35,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 09:12:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:35,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 09:12:35,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 09:12:35,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 09:12:35,285 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {170#false} is VALID [2022-04-28 09:12:35,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {170#false} is VALID [2022-04-28 09:12:35,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(< main_~i~0 1024)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 09:12:35,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {235#(< main_~i~0 1024)} is VALID [2022-04-28 09:12:35,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {239#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:35,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {239#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:35,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 09:12:35,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 09:12:35,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 09:12:35,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-28 09:12:35,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 09:12:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498775937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:35,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:35,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 09:12:35,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:35,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992363852] [2022-04-28 09:12:35,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992363852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:35,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:35,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:12:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083104125] [2022-04-28 09:12:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:35,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-28 09:12:35,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:35,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-28 09:12:35,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:12:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:12:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:12:35,310 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-28 09:12:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:35,369 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:12:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:12:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-28 09:12:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-28 09:12:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 09:12:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-28 09:12:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 09:12:35,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 09:12:35,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:35,394 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:12:35,394 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:12:35,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:12:35,397 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:35,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:12:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 09:12:35,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:35,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,408 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,409 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:35,414 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:12:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:12:35,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:35,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:35,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,416 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:35,421 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:12:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:12:35,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:35,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:35,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:35,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-28 09:12:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:12:35,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 09:12:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:35,424 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:12:35,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-28 09:12:35,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:12:35,438 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-28 09:12:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:12:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:12:35,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:35,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:35,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:35,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:35,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 3 times [2022-04-28 09:12:35,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:35,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33776608] [2022-04-28 09:12:35,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:35,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 4 times [2022-04-28 09:12:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:35,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881145887] [2022-04-28 09:12:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 09:12:35,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 09:12:35,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 09:12:35,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:35,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 09:12:35,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 09:12:35,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 09:12:35,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 09:12:35,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {390#(= main_~i~0 0)} is VALID [2022-04-28 09:12:35,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {390#(= main_~i~0 0)} is VALID [2022-04-28 09:12:35,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:35,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 09:12:35,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 09:12:35,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 09:12:35,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 09:12:35,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 09:12:35,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 09:12:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881145887] [2022-04-28 09:12:35,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881145887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599228053] [2022-04-28 09:12:35,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:12:35,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:35,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:35,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:12:35,744 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:12:35,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:35,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:12:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:35,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 09:12:35,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 09:12:35,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 09:12:35,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 09:12:35,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 09:12:35,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {412#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:35,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {412#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:35,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {391#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {391#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:35,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {392#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:35,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 09:12:35,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 09:12:35,820 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 09:12:35,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 09:12:35,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 09:12:35,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 09:12:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:35,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 09:12:35,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 09:12:35,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 09:12:35,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {386#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {386#false} is VALID [2022-04-28 09:12:35,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {386#false} is VALID [2022-04-28 09:12:35,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(< main_~i~0 1024)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 09:12:35,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {458#(< main_~i~0 1024)} is VALID [2022-04-28 09:12:35,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {462#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:35,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {462#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:35,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {469#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:35,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {469#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:35,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 09:12:35,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 09:12:35,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 09:12:35,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 09:12:35,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 09:12:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:35,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599228053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:35,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:35,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 09:12:35,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:35,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33776608] [2022-04-28 09:12:35,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33776608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:35,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:35,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:12:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908528460] [2022-04-28 09:12:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:35,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-28 09:12:35,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:35,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 09:12:35,955 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-28 09:12:35,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:12:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:35,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:12:35,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:12:35,956 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 09:12:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,063 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:12:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:12:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-28 09:12:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 09:12:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 09:12:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 09:12:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 09:12:36,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 09:12:36,099 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-28 09:12:36,101 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:12:36,101 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:12:36,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:12:36,110 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:36,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:12:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 09:12:36,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:36,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 09:12:36,122 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 09:12:36,122 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 09:12:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,123 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:12:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 09:12:36,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:36,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:36,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 20 states. [2022-04-28 09:12:36,124 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 20 states. [2022-04-28 09:12:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,130 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:12:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 09:12:36,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:36,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:36,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:36,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-28 09:12:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 09:12:36,132 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-28 09:12:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:36,132 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 09:12:36,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-28 09:12:36,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 09:12:36,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 09:12:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:12:36,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:36,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:36,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:36,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:12:36,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 5 times [2022-04-28 09:12:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:36,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176986655] [2022-04-28 09:12:36,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:36,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 6 times [2022-04-28 09:12:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:36,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208375673] [2022-04-28 09:12:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:36,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#(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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 09:12:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 09:12:36,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 09:12:36,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#(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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 09:12:36,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 09:12:36,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 09:12:36,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 09:12:36,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {634#(= main_~i~0 0)} is VALID [2022-04-28 09:12:36,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {634#(= main_~i~0 0)} is VALID [2022-04-28 09:12:36,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:36,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:36,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:36,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:36,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:36,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 09:12:36,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 09:12:36,436 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 09:12:36,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 09:12:36,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 09:12:36,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 09:12:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208375673] [2022-04-28 09:12:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208375673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215782958] [2022-04-28 09:12:36,437 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:12:36,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:36,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:36,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:12:36,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:12:36,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:36,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:12:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:36,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:36,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 09:12:36,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 09:12:36,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 09:12:36,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 09:12:36,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 09:12:36,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {657#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:36,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {657#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {657#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:36,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {635#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:36,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:36,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {636#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:36,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {636#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:36,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:36,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 09:12:36,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 09:12:36,561 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 09:12:36,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 09:12:36,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 09:12:36,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 09:12:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:36,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:36,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 09:12:36,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 09:12:36,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 09:12:36,658 INFO L272 TraceCheckUtils]: 14: Hoare triple {630#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {630#false} is VALID [2022-04-28 09:12:36,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {630#false} is VALID [2022-04-28 09:12:36,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 09:12:36,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {709#(< main_~i~0 1024)} is VALID [2022-04-28 09:12:36,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {713#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:36,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {713#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:36,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {720#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:36,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {720#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:36,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {727#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:36,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {727#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:36,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 09:12:36,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 09:12:36,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 09:12:36,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {629#true} is VALID [2022-04-28 09:12:36,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 09:12:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:36,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215782958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:36,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:36,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 09:12:36,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:36,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176986655] [2022-04-28 09:12:36,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176986655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:36,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:36,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:12:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124595491] [2022-04-28 09:12:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 09:12:36,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:36,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 09:12:36,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:36,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:12:36,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:12:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:12:36,677 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 09:12:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,760 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 09:12:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:12:36,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 09:12:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 09:12:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 09:12:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 09:12:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 09:12:36,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 09:12:36,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:36,784 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:12:36,784 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:12:36,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:12:36,785 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:36,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:12:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 09:12:36,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:36,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 09:12:36,792 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 09:12:36,792 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 09:12:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,793 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:12:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 09:12:36,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:36,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:36,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 22 states. [2022-04-28 09:12:36,793 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 22 states. [2022-04-28 09:12:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:36,794 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:12:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 09:12:36,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:36,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:36,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:36,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-28 09:12:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 09:12:36,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-28 09:12:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:36,795 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 09:12:36,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 09:12:36,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 09:12:36,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:12:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:12:36,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:36,814 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:36,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 09:12:37,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:37,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 7 times [2022-04-28 09:12:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:37,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [845798558] [2022-04-28 09:12:37,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:37,031 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 8 times [2022-04-28 09:12:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369085878] [2022-04-28 09:12:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#(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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 09:12:37,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 09:12:37,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 09:12:37,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:37,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#(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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 09:12:37,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 09:12:37,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 09:12:37,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 09:12:37,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {906#(= main_~i~0 0)} is VALID [2022-04-28 09:12:37,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {906#(= main_~i~0 0)} is VALID [2022-04-28 09:12:37,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 09:12:37,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 09:12:37,093 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 09:12:37,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 09:12:37,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 09:12:37,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 09:12:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369085878] [2022-04-28 09:12:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369085878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487932002] [2022-04-28 09:12:37,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:12:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:37,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:37,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:12:37,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:12:37,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:37,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:12:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:37,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 09:12:37,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 09:12:37,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 09:12:37,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 09:12:37,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 09:12:37,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {930#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:37,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {930#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:37,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {907#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {907#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {908#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {908#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {909#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {910#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 09:12:37,235 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 09:12:37,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 09:12:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:37,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:37,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 09:12:37,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 09:12:37,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 09:12:37,344 INFO L272 TraceCheckUtils]: 16: Hoare triple {902#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {902#false} is VALID [2022-04-28 09:12:37,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {902#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {902#false} is VALID [2022-04-28 09:12:37,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#(< main_~i~0 1024)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 09:12:37,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {988#(< main_~i~0 1024)} is VALID [2022-04-28 09:12:37,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {992#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:37,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {999#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {992#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:37,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {999#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:37,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {999#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:37,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1006#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:37,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1006#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:37,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1013#(< main_~i~0 1020)} is VALID [2022-04-28 09:12:37,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1013#(< main_~i~0 1020)} is VALID [2022-04-28 09:12:37,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 09:12:37,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 09:12:37,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 09:12:37,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 09:12:37,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 09:12:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487932002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:37,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:37,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:12:37,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [845798558] [2022-04-28 09:12:37,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [845798558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:37,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:37,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:12:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798569045] [2022-04-28 09:12:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2022-04-28 09:12:37,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:37,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 09:12:37,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:37,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:12:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:12:37,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:12:37,363 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 09:12:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:37,456 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 09:12:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:12:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2022-04-28 09:12:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 09:12:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 09:12:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 09:12:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 09:12:37,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 09:12:37,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:37,477 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:12:37,477 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:12:37,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:12:37,479 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:37,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:12:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 09:12:37,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:37,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 09:12:37,491 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 09:12:37,491 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 09:12:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:37,493 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:12:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:12:37,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:37,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:37,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 24 states. [2022-04-28 09:12:37,496 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 24 states. [2022-04-28 09:12:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:37,497 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:12:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:12:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:37,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:37,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:37,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 09:12:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 09:12:37,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-28 09:12:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:37,499 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 09:12:37,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-28 09:12:37,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 09:12:37,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 09:12:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 09:12:37,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:37,516 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:37,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:37,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:37,732 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 9 times [2022-04-28 09:12:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896399315] [2022-04-28 09:12:37,735 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:37,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 10 times [2022-04-28 09:12:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:37,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055569844] [2022-04-28 09:12:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {1212#(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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 09:12:37,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 09:12:37,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 09:12:37,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:37,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1212#(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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 09:12:37,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 09:12:37,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 09:12:37,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 09:12:37,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1206#(= main_~i~0 0)} is VALID [2022-04-28 09:12:37,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1206#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1206#(= main_~i~0 0)} is VALID [2022-04-28 09:12:37,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1206#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-28 09:12:37,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 09:12:37,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 09:12:37,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 09:12:37,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 09:12:37,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 09:12:37,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 09:12:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:37,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055569844] [2022-04-28 09:12:37,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055569844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:37,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129316138] [2022-04-28 09:12:37,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:12:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:37,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:37,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:12:37,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:12:37,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:37,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:12:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:37,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:37,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 09:12:37,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 09:12:37,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 09:12:37,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 09:12:37,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 09:12:37,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1231#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:37,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1231#(<= main_~i~0 0)} is VALID [2022-04-28 09:12:37,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1207#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:37,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1208#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1208#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:37,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1209#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1209#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:37,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1210#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1210#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1210#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1211#(<= main_~i~0 5)} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 09:12:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:37,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:38,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 09:12:38,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 09:12:38,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 09:12:38,082 INFO L272 TraceCheckUtils]: 18: Hoare triple {1202#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {1202#false} is VALID [2022-04-28 09:12:38,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1202#false} is VALID [2022-04-28 09:12:38,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 09:12:38,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#(< main_~i~0 1023)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1295#(< main_~i~0 1024)} is VALID [2022-04-28 09:12:38,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#(< main_~i~0 1023)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1299#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:38,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(< main_~i~0 1022)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1299#(< main_~i~0 1023)} is VALID [2022-04-28 09:12:38,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#(< main_~i~0 1022)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1306#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:38,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(< main_~i~0 1021)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1306#(< main_~i~0 1022)} is VALID [2022-04-28 09:12:38,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(< main_~i~0 1021)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1313#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:38,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(< main_~i~0 1020)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1313#(< main_~i~0 1021)} is VALID [2022-04-28 09:12:38,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(< main_~i~0 1020)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1320#(< main_~i~0 1020)} is VALID [2022-04-28 09:12:38,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(< main_~i~0 1019)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1320#(< main_~i~0 1020)} is VALID [2022-04-28 09:12:38,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(< main_~i~0 1019)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1327#(< main_~i~0 1019)} is VALID [2022-04-28 09:12:38,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1201#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1327#(< main_~i~0 1019)} is VALID [2022-04-28 09:12:38,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 09:12:38,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 09:12:38,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 09:12:38,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {1201#true} is VALID [2022-04-28 09:12:38,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 09:12:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:38,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129316138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:38,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:38,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 09:12:38,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:38,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896399315] [2022-04-28 09:12:38,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896399315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:38,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:38,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:12:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943181924] [2022-04-28 09:12:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 09:12:38,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:38,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 09:12:38,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:12:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:12:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:12:38,102 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 09:12:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:38,203 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 09:12:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:12:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 09:12:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 09:12:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:12:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 09:12:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 09:12:38,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 09:12:38,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:38,225 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:12:38,225 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:12:38,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:12:38,226 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:38,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:12:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 09:12:38,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:38,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 09:12:38,237 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 09:12:38,237 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 09:12:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:38,238 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:12:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:12:38,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:38,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:38,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 26 states. [2022-04-28 09:12:38,238 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 26 states. [2022-04-28 09:12:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:38,239 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:12:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:12:38,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:38,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:38,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:38,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 09:12:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 09:12:38,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-28 09:12:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:38,240 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 09:12:38,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-28 09:12:38,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 09:12:38,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 09:12:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:12:38,257 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:38,257 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:38,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:38,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:38,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 11 times [2022-04-28 09:12:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:38,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603493907] [2022-04-28 09:12:38,476 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:38,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 12 times [2022-04-28 09:12:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559379673] [2022-04-28 09:12:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:38,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {1541#(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(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 09:12:38,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 09:12:38,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 09:12:38,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:38,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#(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(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 09:12:38,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 09:12:38,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 09:12:38,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 09:12:38,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1534#(= main_~i~0 0)} is VALID [2022-04-28 09:12:38,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1534#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1534#(= main_~i~0 0)} is VALID [2022-04-28 09:12:38,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1535#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:38,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1535#(<= main_~i~0 1)} is VALID [2022-04-28 09:12:38,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1536#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:38,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1536#(<= main_~i~0 2)} is VALID [2022-04-28 09:12:38,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1537#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:38,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1537#(<= main_~i~0 3)} is VALID [2022-04-28 09:12:38,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1537#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1538#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:38,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1538#(<= main_~i~0 4)} is VALID [2022-04-28 09:12:38,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1539#(<= main_~i~0 5)} is VALID [2022-04-28 09:12:38,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 5)} is VALID [2022-04-28 09:12:38,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1540#(<= main_~i~0 6)} is VALID [2022-04-28 09:12:38,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-28 09:12:38,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#false} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1530#false} is VALID [2022-04-28 09:12:38,572 INFO L272 TraceCheckUtils]: 20: Hoare triple {1530#false} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {1530#false} is VALID [2022-04-28 09:12:38,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-28 09:12:38,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 09:12:38,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 09:12:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:12:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:38,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559379673] [2022-04-28 09:12:38,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559379673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:38,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318970582] [2022-04-28 09:12:38,572 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:12:38,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:38,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:38,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:38,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 09:12:38,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:12:38,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:38,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:12:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:38,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:38,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-04-28 09:12:38,941 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-28 09:12:38,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-04-28 09:12:39,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-28 09:12:39,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} #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(12, 2);call #Ultimate.allocInit(12, 3); {1529#true} is VALID [2022-04-28 09:12:39,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 09:12:39,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 09:12:39,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 09:12:39,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;~i~0 := 0; {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1529#true} is VALID [2022-04-28 09:12:39,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1529#true} is VALID [2022-04-28 09:12:39,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1593#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* main_~i~0 4)))))} is VALID [2022-04-28 09:12:39,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {1593#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* main_~i~0 4)))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1597#(exists ((v_main_~i~0_54 Int)) (and (<= main_~i~0 (+ v_main_~i~0_54 1)) (< v_main_~i~0_54 1024) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|)))))} is VALID [2022-04-28 09:12:39,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {1597#(exists ((v_main_~i~0_54 Int)) (and (<= main_~i~0 (+ v_main_~i~0_54 1)) (< v_main_~i~0_54 1024) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|)))))} assume !(~i~0 < 1024); {1601#(exists ((v_main_~i~0_54 Int)) (and (< v_main_~i~0_54 1024) (<= 1023 v_main_~i~0_54) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|)))))} is VALID [2022-04-28 09:12:39,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#(exists ((v_main_~i~0_54 Int)) (and (< v_main_~i~0_54 1024) (<= 1023 v_main_~i~0_54) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|)))))} call #t~mem5 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1605#(and (< |main_#t~mem5| 1024) (<= 1023 |main_#t~mem5|))} is VALID [2022-04-28 09:12:39,048 INFO L272 TraceCheckUtils]: 20: Hoare triple {1605#(and (< |main_#t~mem5| 1024) (<= 1023 |main_#t~mem5|))} call __VERIFIER_assert((if 1023 == #t~mem5 then 1 else 0)); {1609#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:12:39,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1613#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:12:39,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {1613#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 09:12:39,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 09:12:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:12:39,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:12:39,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318970582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:39,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:12:39,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-28 09:12:39,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:39,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603493907] [2022-04-28 09:12:39,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603493907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:39,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:39,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:12:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442028789] [2022-04-28 09:12:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 24 [2022-04-28 09:12:39,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:39,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 09:12:39,063 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-28 09:12:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:12:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:12:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:12:39,064 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 09:12:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:39,129 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 09:12:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:12:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 24 [2022-04-28 09:12:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 09:12:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-28 09:12:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 09:12:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-28 09:12:39,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-28 09:12:39,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:39,142 INFO L225 Difference]: With dead ends: 25 [2022-04-28 09:12:39,142 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:12:39,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:12:39,143 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:39,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-04-28 09:12:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:12:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:12:39,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:39,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-28 09:12:39,144 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-28 09:12:39,144 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-28 09:12:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:39,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:12:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:39,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:39,144 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-28 09:12:39,144 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-28 09:12:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:39,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:12:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:39,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:39,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:39,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:39,145 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) [2022-04-28 09:12:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:12:39,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 09:12:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:39,145 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:12:39,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 09:12:39,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:12:39,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:39,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:39,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:12:39,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:39,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:39,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:12:39,506 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:12:39,506 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:12:39,506 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:12:39,506 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 21) the Hoare annotation is: true [2022-04-28 09:12:39,506 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 21) the Hoare annotation is: true [2022-04-28 09:12:39,506 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (< |main_#t~mem5| 1024) (<= 1023 |main_#t~mem5|)) [2022-04-28 09:12:39,506 INFO L902 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: true [2022-04-28 09:12:39,506 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 18) the Hoare annotation is: (and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* main_~i~0 4))))) [2022-04-28 09:12:39,506 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 18) the Hoare annotation is: (or (= main_~i~0 0) (exists ((v_main_~i~0_54 Int)) (and (<= main_~i~0 (+ v_main_~i~0_54 1)) (< v_main_~i~0_54 1024) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|)))))) [2022-04-28 09:12:39,506 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 21) the Hoare annotation is: true [2022-04-28 09:12:39,506 INFO L895 garLoopResultBuilder]: At program point L16-4(lines 16 18) the Hoare annotation is: (exists ((v_main_~i~0_54 Int)) (and (< v_main_~i~0_54 1024) (<= 1023 v_main_~i~0_54) (= v_main_~i~0_54 (select (select |#memory_int| |main_~#A~0.base|) (+ (* v_main_~i~0_54 4) |main_~#A~0.offset|))))) [2022-04-28 09:12:39,506 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:12:39,507 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:12:39,507 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 09:12:39,507 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:12:39,509 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2] [2022-04-28 09:12:39,511 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:12:39,513 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:12:39,514 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:12:39,520 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:12:39,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:12:39 BoogieIcfgContainer [2022-04-28 09:12:39,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:12:39,529 INFO L158 Benchmark]: Toolchain (without parser) took 5595.24ms. Allocated memory was 205.5MB in the beginning and 262.1MB in the end (delta: 56.6MB). Free memory was 148.3MB in the beginning and 124.7MB in the end (delta: 23.7MB). Peak memory consumption was 79.8MB. Max. memory is 8.0GB. [2022-04-28 09:12:39,529 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:12:39,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.68ms. Allocated memory was 205.5MB in the beginning and 262.1MB in the end (delta: 56.6MB). Free memory was 148.1MB in the beginning and 232.9MB in the end (delta: -84.8MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-28 09:12:39,530 INFO L158 Benchmark]: Boogie Preprocessor took 25.58ms. Allocated memory is still 262.1MB. Free memory was 232.9MB in the beginning and 231.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:12:39,530 INFO L158 Benchmark]: RCFGBuilder took 195.27ms. Allocated memory is still 262.1MB. Free memory was 231.3MB in the beginning and 219.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:12:39,530 INFO L158 Benchmark]: TraceAbstraction took 5173.94ms. Allocated memory is still 262.1MB. Free memory was 219.3MB in the beginning and 124.7MB in the end (delta: 94.6MB). Peak memory consumption was 95.6MB. Max. memory is 8.0GB. [2022-04-28 09:12:39,531 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.13ms. Allocated memory is still 205.5MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.68ms. Allocated memory was 205.5MB in the beginning and 262.1MB in the end (delta: 56.6MB). Free memory was 148.1MB in the beginning and 232.9MB in the end (delta: -84.8MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.58ms. Allocated memory is still 262.1MB. Free memory was 232.9MB in the beginning and 231.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.27ms. Allocated memory is still 262.1MB. Free memory was 231.3MB in the beginning and 219.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5173.94ms. Allocated memory is still 262.1MB. Free memory was 219.3MB in the beginning and 124.7MB in the end (delta: 94.6MB). Peak memory consumption was 95.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] * 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: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 86 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 47, 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 57 PreInvPairs, 87 NumberOfFragments, 102 HoareAnnotationTreeSize, 57 FomulaSimplifications, 15 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 205 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 09:12:39,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] Derived loop invariant: i == 0 || (\exists v_main_~i~0_54 : int :: (i <= v_main_~i~0_54 + 1 && v_main_~i~0_54 < 1024) && v_main_~i~0_54 == unknown-#memory_int-unknown[A][v_main_~i~0_54 * 4 + A]) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:12:39,556 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...