/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:53:27,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:53:27,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:53:27,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:53:27,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:53:27,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:53:27,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:53:27,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:53:27,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:53:27,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:53:27,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:53:27,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:53:27,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:53:27,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:53:27,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:53:27,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:53:27,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:53:27,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:53:27,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:53:27,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:53:27,428 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:53:27,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:53:27,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:53:27,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:53:27,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:53:27,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:53:27,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:53:27,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:53:27,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:53:27,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:53:27,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:53:27,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:53:27,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:53:27,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:53:27,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:53:27,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:53:27,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:53:27,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:53:27,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:53:27,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:53:27,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:53:27,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:53:27,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:53:27,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:53:27,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:53:27,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:53:27,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:53:27,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:53:27,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:53:27,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:53:27,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:53:27,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:53:27,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:53:27,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:53:27,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:53:27,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:53:27,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:53:27,456 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:53:27,456 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:53:27,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:53:27,456 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:53:27,456 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 02:53:27,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:53:27,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:53:27,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:53:27,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:53:27,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:53:27,679 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 02:53:27,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f8e0f14/444e243c27e1413cb09f106d94b16e15/FLAG9c092e2a3 [2022-04-28 02:53:28,111 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:53:28,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c [2022-04-28 02:53:28,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f8e0f14/444e243c27e1413cb09f106d94b16e15/FLAG9c092e2a3 [2022-04-28 02:53:28,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f8e0f14/444e243c27e1413cb09f106d94b16e15 [2022-04-28 02:53:28,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:53:28,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:53:28,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:53:28,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:53:28,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:53:28,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599df675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28, skipping insertion in model container [2022-04-28 02:53:28,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:53:28,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:53:28,299 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 02:53:28,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:53:28,328 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:53:28,337 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 02:53:28,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:53:28,352 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:53:28,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28 WrapperNode [2022-04-28 02:53:28,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:53:28,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:53:28,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:53:28,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:53:28,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:53:28,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:53:28,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:53:28,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:53:28,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (1/1) ... [2022-04-28 02:53:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:53:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:28,434 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 02:53:28,463 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 02:53:28,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:53:28,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:53:28,472 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:53:28,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:53:28,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:53:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:53:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:53:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:53:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:53:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:53:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:53:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:53:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:53:28,520 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:53:28,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:53:28,604 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:53:28,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:53:28,608 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:53:28,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:53:28 BoogieIcfgContainer [2022-04-28 02:53:28,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:53:28,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:53:28,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:53:28,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:53:28,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:53:28" (1/3) ... [2022-04-28 02:53:28,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768d380a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:53:28, skipping insertion in model container [2022-04-28 02:53:28,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:53:28" (2/3) ... [2022-04-28 02:53:28,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768d380a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:53:28, skipping insertion in model container [2022-04-28 02:53:28,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:53:28" (3/3) ... [2022-04-28 02:53:28,615 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-2.c [2022-04-28 02:53:28,624 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:53:28,625 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:53:28,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:53:28,657 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@5d407c57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78e93068 [2022-04-28 02:53:28,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:53:28,662 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 02:53:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:53:28,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:28,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:28,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 1 times [2022-04-28 02:53:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:28,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149852169] [2022-04-28 02:53:28,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:53:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 147271546, now seen corresponding path program 2 times [2022-04-28 02:53:28,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:28,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067298788] [2022-04-28 02:53:28,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:28,921 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 02:53:28,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:53:28,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 02:53:28,932 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 02:53:28,932 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 02:53:28,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:53:28,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #39#return; {24#true} is VALID [2022-04-28 02:53:28,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 02:53:28,933 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 02:53:28,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < 1024); {25#false} is VALID [2022-04-28 02:53:28,934 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 02:53:28,934 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 02:53:28,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 02:53:28,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 02:53:28,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 02:53:28,936 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 02:53:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:28,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067298788] [2022-04-28 02:53:28,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067298788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:28,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:28,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:53:28,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:28,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [149852169] [2022-04-28 02:53:28,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [149852169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:28,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:28,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:53:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44504687] [2022-04-28 02:53:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:28,944 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 02:53:28,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:28,947 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 02:53:28,965 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 02:53:28,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:53:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:53:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:53:28,991 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 02:53:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,139 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 02:53:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:53:29,140 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 02:53:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:29,141 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 02:53:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:53:29,149 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 02:53:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:53:29,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 02:53:29,200 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 02:53:29,210 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:53:29,210 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 02:53:29,213 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 02:53:29,218 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 02:53:29,219 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 02:53:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 02:53:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 02:53:29,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:29,239 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 02:53:29,240 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 02:53:29,240 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 02:53:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,242 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:53:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:53:29,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:29,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:29,243 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 02:53:29,243 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 02:53:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,244 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:53:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:53:29,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:29,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:29,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:29,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:29,245 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 02:53:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:53:29,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 02:53:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:29,247 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:53:29,248 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 02:53:29,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:53:29,266 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 02:53:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:53:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:53:29,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:29,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:29,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:53:29,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 1 times [2022-04-28 02:53:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:29,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622357330] [2022-04-28 02:53:29,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:29,280 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:29,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1080052612, now seen corresponding path program 2 times [2022-04-28 02:53:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:29,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909660694] [2022-04-28 02:53:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:29,338 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 02:53:29,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:53:29,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:53:29,339 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 02:53:29,339 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 02:53:29,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:53:29,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:53:29,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:53:29,340 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 02:53:29,340 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 02:53:29,341 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 02:53:29,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:53:29,341 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 02:53:29,342 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 02:53:29,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:53:29,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:53:29,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:53:29,342 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 02:53:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909660694] [2022-04-28 02:53:29,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909660694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408915977] [2022-04-28 02:53:29,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:53:29,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:29,359 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 02:53:29,361 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 02:53:29,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:53:29,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:29,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 02:53:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:29,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:29,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 02:53:29,507 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 02:53:29,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:53:29,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:53:29,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:53:29,508 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 02:53:29,509 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 02:53:29,510 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 02:53:29,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= main_~i~0 1)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:53:29,510 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 02:53:29,511 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 02:53:29,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:53:29,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:53:29,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:53:29,511 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 02:53:29,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:53:29,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-28 02:53:29,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-28 02:53:29,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-28 02:53:29,619 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 02:53:29,619 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 02:53:29,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(< main_~i~0 1024)} assume !(~i~0 < 1024); {170#false} is VALID [2022-04-28 02:53:29,624 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 02:53:29,624 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 02:53:29,625 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 02:53:29,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2022-04-28 02:53:29,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #39#return; {169#true} is VALID [2022-04-28 02:53:29,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-28 02:53:29,626 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 02:53:29,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-28 02:53:29,626 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 02:53:29,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408915977] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:53:29,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:53:29,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:53:29,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:29,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622357330] [2022-04-28 02:53:29,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622357330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:29,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:29,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:53:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679632686] [2022-04-28 02:53:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:29,631 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 02:53:29,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:29,631 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 02:53:29,643 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 02:53:29,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:53:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:53:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:53:29,645 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 02:53:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,706 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:53:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:53:29,707 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 02:53:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:29,707 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 02:53:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:53:29,711 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 02:53:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:53:29,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 02:53:29,731 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 02:53:29,732 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:53:29,732 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:53:29,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:53:29,733 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 02:53:29,734 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 02:53:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:53:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 02:53:29,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:29,739 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 02:53:29,739 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 02:53:29,740 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 02:53:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,741 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:53:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:53:29,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:29,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:29,741 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 02:53:29,741 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 02:53:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:29,742 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:53:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:53:29,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:29,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:29,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:29,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:29,743 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 02:53:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 02:53:29,744 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 02:53:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:29,744 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 02:53:29,744 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 02:53:29,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 02:53:29,767 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 02:53:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:53:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:53:29,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:29,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:29,787 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 02:53:29,987 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 02:53:29,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 3 times [2022-04-28 02:53:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410511510] [2022-04-28 02:53:29,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:29,993 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:29,993 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 577437950, now seen corresponding path program 4 times [2022-04-28 02:53:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626847321] [2022-04-28 02:53:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,074 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 02:53:30,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:53:30,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:53:30,075 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 02:53:30,075 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 02:53:30,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:53:30,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:53:30,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:53:30,077 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 02:53:30,077 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 02:53:30,078 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 02:53:30,078 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 02:53:30,079 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 02:53:30,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:53:30,079 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 02:53:30,079 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 02:53:30,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:53:30,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:53:30,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:53:30,080 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 02:53:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626847321] [2022-04-28 02:53:30,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626847321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034542322] [2022-04-28 02:53:30,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:53:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:30,086 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 02:53:30,087 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 02:53:30,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:53:30,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:30,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:53:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:30,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:53:30,202 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 02:53:30,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:53:30,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:53:30,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:53:30,204 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 02:53:30,204 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 02:53:30,204 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 02:53:30,205 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 02:53:30,205 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 02:53:30,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(<= main_~i~0 2)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:53:30,206 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 02:53:30,206 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 02:53:30,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:53:30,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:53:30,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:53:30,209 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 02:53:30,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:53:30,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:53:30,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:53:30,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 02:53:30,308 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 02:53:30,308 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 02:53:30,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(< main_~i~0 1024)} assume !(~i~0 < 1024); {386#false} is VALID [2022-04-28 02:53:30,309 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 02:53:30,309 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 02:53:30,312 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 02:53:30,312 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 02:53:30,313 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 02:53:30,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 02:53:30,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #39#return; {385#true} is VALID [2022-04-28 02:53:30,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:53:30,314 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 02:53:30,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:53:30,314 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 02:53:30,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034542322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:53:30,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:53:30,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:53:30,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:30,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410511510] [2022-04-28 02:53:30,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410511510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:30,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:30,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:53:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392649946] [2022-04-28 02:53:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:30,316 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 02:53:30,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:30,317 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 02:53:30,327 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 02:53:30,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:53:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:53:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:53:30,330 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 02:53:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:30,434 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:53:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:53:30,435 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 02:53:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:30,435 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 02:53:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:53:30,440 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 02:53:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:53:30,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 02:53:30,459 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 02:53:30,461 INFO L225 Difference]: With dead ends: 26 [2022-04-28 02:53:30,461 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:53:30,462 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 02:53:30,481 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 02:53:30,482 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 02:53:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:53:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 02:53:30,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:30,491 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 02:53:30,493 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 02:53:30,493 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 02:53:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:30,495 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:53:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:53:30,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:30,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:30,496 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 02:53:30,496 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 02:53:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:30,497 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:53:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:53:30,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:30,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:30,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:30,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:30,497 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 02:53:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 02:53:30,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-28 02:53:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:30,498 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 02:53:30,498 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 02:53:30,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 02:53:30,518 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 02:53:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:53:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:53:30,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:30,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:30,537 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 02:53:30,735 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 02:53:30,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 5 times [2022-04-28 02:53:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [429022403] [2022-04-28 02:53:30,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:30,741 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:30,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash -6998784, now seen corresponding path program 6 times [2022-04-28 02:53:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:30,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243429133] [2022-04-28 02:53:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,795 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 02:53:30,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:53:30,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:53:30,796 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 02:53:30,796 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 02:53:30,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:53:30,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:53:30,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:53:30,797 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 02:53:30,797 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 02:53:30,797 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 02:53:30,798 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 02:53:30,798 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 02:53:30,798 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 02:53:30,799 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 02:53:30,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:53:30,799 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 02:53:30,799 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 02:53:30,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:53:30,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:53:30,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:53:30,800 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 02:53:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:30,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243429133] [2022-04-28 02:53:30,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243429133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:30,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381094196] [2022-04-28 02:53:30,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:53:30,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:30,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:30,801 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 02:53:30,802 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 02:53:30,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:53:30,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:30,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:53:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:30,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:30,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 02:53:30,909 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 02:53:30,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:53:30,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:53:30,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:53:30,910 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 02:53:30,910 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 02:53:30,911 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 02:53:30,911 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 02:53:30,911 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 02:53:30,912 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 02:53:30,912 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 02:53:30,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~i~0 3)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:53:30,913 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 02:53:30,913 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 02:53:30,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:53:30,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:53:30,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:53:30,913 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 02:53:30,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:53:31,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-04-28 02:53:31,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2022-04-28 02:53:31,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2022-04-28 02:53:31,009 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 02:53:31,009 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 02:53:31,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {630#false} is VALID [2022-04-28 02:53:31,013 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 02:53:31,013 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 02:53:31,014 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 02:53:31,014 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 02:53:31,015 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 02:53:31,015 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 02:53:31,015 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 02:53:31,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {629#true} call #t~ret6 := main(); {629#true} is VALID [2022-04-28 02:53:31,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {629#true} {629#true} #39#return; {629#true} is VALID [2022-04-28 02:53:31,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2022-04-28 02:53:31,016 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 02:53:31,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {629#true} is VALID [2022-04-28 02:53:31,016 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 02:53:31,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381094196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:53:31,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:53:31,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:53:31,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:31,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [429022403] [2022-04-28 02:53:31,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [429022403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:31,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:31,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:53:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083519534] [2022-04-28 02:53:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:31,018 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 02:53:31,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:31,018 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 02:53:31,030 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 02:53:31,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:53:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:53:31,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:53:31,031 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 02:53:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,128 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:53:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:53:31,128 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 02:53:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:31,129 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 02:53:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:53:31,130 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 02:53:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:53:31,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 02:53:31,150 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 02:53:31,154 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:53:31,154 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:53:31,154 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 02:53:31,155 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 02:53:31,156 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 02:53:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:53:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 02:53:31,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:31,164 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 02:53:31,165 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 02:53:31,165 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 02:53:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,166 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:53:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:53:31,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:31,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:31,167 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 02:53:31,167 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 02:53:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,170 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:53:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:53:31,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:31,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:31,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:31,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:31,171 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 02:53:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 02:53:31,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-28 02:53:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:31,175 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 02:53:31,175 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 02:53:31,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 02:53:31,198 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 02:53:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:53:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:53:31,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:31,199 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:31,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:53:31,399 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 02:53:31,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 7 times [2022-04-28 02:53:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835831553] [2022-04-28 02:53:31,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:31,404 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:31,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash 990015618, now seen corresponding path program 8 times [2022-04-28 02:53:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:31,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444384004] [2022-04-28 02:53:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:31,474 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 02:53:31,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:53:31,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:53:31,475 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 02:53:31,475 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 02:53:31,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:53:31,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:53:31,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:53:31,476 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 02:53:31,476 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 02:53:31,477 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 02:53:31,477 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 02:53:31,477 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 02:53:31,478 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 02:53:31,478 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 02:53:31,479 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 02:53:31,479 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 02:53:31,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:53:31,480 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 02:53:31,480 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 02:53:31,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:53:31,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:53:31,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:53:31,480 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 02:53:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444384004] [2022-04-28 02:53:31,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444384004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:31,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786378258] [2022-04-28 02:53:31,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:53:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:31,482 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 02:53:31,483 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 02:53:31,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:53:31,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:31,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:53:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:31,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:31,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 02:53:31,597 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 02:53:31,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:53:31,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:53:31,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:53:31,598 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 02:53:31,599 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 02:53:31,599 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 02:53:31,600 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 02:53:31,600 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 02:53:31,604 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 02:53:31,605 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 02:53:31,605 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 02:53:31,605 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 02:53:31,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(<= main_~i~0 4)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:53:31,606 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 02:53:31,606 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 02:53:31,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:53:31,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:53:31,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:53:31,607 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 02:53:31,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:53:31,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 02:53:31,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2022-04-28 02:53:31,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2022-04-28 02:53:31,732 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 02:53:31,732 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 02:53:31,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#(< main_~i~0 1024)} assume !(~i~0 < 1024); {902#false} is VALID [2022-04-28 02:53:31,740 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 02:53:31,740 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 02:53:31,741 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 02:53:31,741 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 02:53:31,741 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 02:53:31,742 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 02:53:31,742 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 02:53:31,742 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 02:53:31,743 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 02:53:31,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 02:53:31,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #39#return; {901#true} is VALID [2022-04-28 02:53:31,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 02:53:31,743 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 02:53:31,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 02:53:31,744 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 02:53:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786378258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:53:31,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:53:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:53:31,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835831553] [2022-04-28 02:53:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835831553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:53:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967712573] [2022-04-28 02:53:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:31,745 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 02:53:31,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:31,745 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 02:53:31,772 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 02:53:31,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:53:31,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:53:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:53:31,773 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 02:53:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,896 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:53:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:53:31,896 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 02:53:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:31,896 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 02:53:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:53:31,898 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 02:53:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:53:31,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 02:53:31,920 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 02:53:31,921 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:53:31,921 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:53:31,922 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 02:53:31,922 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 02:53:31,922 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 02:53:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:53:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 02:53:31,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:31,935 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 02:53:31,935 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 02:53:31,935 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 02:53:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,936 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:53:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:53:31,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:31,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:31,936 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 02:53:31,936 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 02:53:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:31,937 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:53:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:53:31,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:31,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:31,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:31,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:31,937 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 02:53:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 02:53:31,938 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-28 02:53:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:31,938 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 02:53:31,938 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 02:53:31,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 02:53:31,956 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 02:53:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:53:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:53:31,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:31,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:31,985 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 02:53:32,185 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 02:53:32,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 9 times [2022-04-28 02:53:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:32,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916974631] [2022-04-28 02:53:32,188 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:32,188 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:32,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1343148932, now seen corresponding path program 10 times [2022-04-28 02:53:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:32,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528384852] [2022-04-28 02:53:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:32,265 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 02:53:32,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:53:32,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:53:32,266 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 02:53:32,266 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 02:53:32,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:53:32,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:53:32,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:53:32,267 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 02:53:32,267 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 02:53:32,267 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 02:53:32,268 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 02:53:32,268 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 02:53:32,269 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 02:53:32,269 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 02:53:32,269 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 02:53:32,270 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 02:53:32,278 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 02:53:32,278 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 02:53:32,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:53:32,279 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 02:53:32,279 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 02:53:32,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:53:32,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:53:32,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:53:32,280 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 02:53:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528384852] [2022-04-28 02:53:32,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528384852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132161880] [2022-04-28 02:53:32,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:53:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:32,281 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 02:53:32,282 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 02:53:32,317 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:53:32,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:32,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:53:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:32,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:32,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 02:53:32,425 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 02:53:32,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:53:32,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:53:32,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:53:32,425 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 02:53:32,426 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 02:53:32,426 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 02:53:32,426 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 02:53:32,427 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 02:53:32,427 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 02:53:32,427 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 02:53:32,428 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 02:53:32,428 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 02:53:32,428 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 02:53:32,429 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 02:53:32,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(<= main_~i~0 5)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:53:32,429 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 02:53:32,429 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 02:53:32,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:53:32,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:53:32,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:53:32,430 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 02:53:32,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:53:32,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#false} assume !false; {1202#false} is VALID [2022-04-28 02:53:32,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#false} assume 0 == ~cond; {1202#false} is VALID [2022-04-28 02:53:32,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#false} ~cond := #in~cond; {1202#false} is VALID [2022-04-28 02:53:32,570 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 02:53:32,570 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 02:53:32,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1202#false} is VALID [2022-04-28 02:53:32,571 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 02:53:32,571 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 02:53:32,571 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 02:53:32,572 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 02:53:32,572 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 02:53:32,572 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 02:53:32,573 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 02:53:32,573 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 02:53:32,574 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 02:53:32,574 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 02:53:32,574 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 02:53:32,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {1201#true} call #t~ret6 := main(); {1201#true} is VALID [2022-04-28 02:53:32,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1201#true} {1201#true} #39#return; {1201#true} is VALID [2022-04-28 02:53:32,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#true} assume true; {1201#true} is VALID [2022-04-28 02:53:32,575 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 02:53:32,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {1201#true} call ULTIMATE.init(); {1201#true} is VALID [2022-04-28 02:53:32,575 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 02:53:32,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132161880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:53:32,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:53:32,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:53:32,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:32,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916974631] [2022-04-28 02:53:32,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916974631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:32,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:32,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:53:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853518374] [2022-04-28 02:53:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:32,576 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 02:53:32,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:32,576 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 02:53:32,589 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 02:53:32,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:53:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:53:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:53:32,590 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 02:53:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:32,707 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:53:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:53:32,707 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 02:53:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:32,708 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 02:53:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:53:32,708 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 02:53:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:53:32,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 02:53:32,732 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 02:53:32,732 INFO L225 Difference]: With dead ends: 32 [2022-04-28 02:53:32,732 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:53:32,733 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 02:53:32,733 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 02:53:32,733 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 02:53:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:53:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 02:53:32,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:32,744 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 02:53:32,745 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 02:53:32,745 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 02:53:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:32,746 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:53:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:53:32,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:32,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:32,746 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 02:53:32,746 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 02:53:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:32,747 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:53:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:53:32,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:32,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:32,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:32,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:32,747 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 02:53:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 02:53:32,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-28 02:53:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:32,748 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 02:53:32,748 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 02:53:32,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 02:53:32,767 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 02:53:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:53:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:53:32,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:53:32,768 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:53:32,786 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 02:53:32,982 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 02:53:32,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:53:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:53:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 11 times [2022-04-28 02:53:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:32,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002898589] [2022-04-28 02:53:32,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:53:32,985 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:53:32,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:53:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1401847302, now seen corresponding path program 12 times [2022-04-28 02:53:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:53:32,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087546441] [2022-04-28 02:53:32,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:53:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:53:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:53:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:33,081 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 02:53:33,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:53:33,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:53:33,082 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 02:53:33,084 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 02:53:33,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:53:33,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:53:33,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 02:53:33,086 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 02:53:33,086 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 02:53:33,087 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 02:53:33,087 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 02:53:33,087 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 02:53:33,088 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 02:53:33,088 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 02:53:33,088 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 02:53:33,089 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 02:53:33,089 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 02:53:33,089 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 02:53:33,090 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 02:53:33,090 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 02:53:33,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1540#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1530#false} is VALID [2022-04-28 02:53:33,090 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 02:53:33,090 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 02:53:33,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#false} ~cond := #in~cond; {1530#false} is VALID [2022-04-28 02:53:33,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#false} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 02:53:33,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 02:53:33,091 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 02:53:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:53:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087546441] [2022-04-28 02:53:33,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087546441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:53:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167141383] [2022-04-28 02:53:33,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:53:33,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:53:33,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:53:33,093 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 02:53:33,094 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 02:53:33,132 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:53:33,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:53:33,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:53:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:53:33,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:53:33,200 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 02:53:33,505 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-28 02:53:33,505 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 02:53:33,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-28 02:53:33,613 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 02:53:33,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-28 02:53:33,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #39#return; {1529#true} is VALID [2022-04-28 02:53:33,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-28 02:53:33,613 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 02:53:33,613 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 02:53:33,613 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 02:53:33,613 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 02:53:33,613 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 02:53:33,613 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 02:53:33,613 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 02:53:33,614 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 02:53:33,614 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 02:53:33,614 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 02:53:33,614 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 02:53:33,614 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 02:53:33,617 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 02:53:33,618 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 02:53:33,618 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 02:53:33,619 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 02:53:33,619 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 02:53:33,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {1613#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1530#false} is VALID [2022-04-28 02:53:33,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-28 02:53:33,620 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 02:53:33,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:53:33,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167141383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:33,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 02:53:33,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-28 02:53:33,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:53:33,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002898589] [2022-04-28 02:53:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002898589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:53:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:53:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:53:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314635228] [2022-04-28 02:53:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:53:33,621 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 02:53:33,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:53:33,622 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 02:53:33,634 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 02:53:33,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:53:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:53:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:53:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:53:33,635 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 02:53:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:33,725 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 02:53:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:53:33,725 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 02:53:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:53:33,725 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 02:53:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-28 02:53:33,726 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 02:53:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-28 02:53:33,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-28 02:53:33,749 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 02:53:33,749 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:53:33,749 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:53:33,749 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 02:53:33,750 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 02:53:33,750 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 02:53:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:53:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:53:33,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:53:33,751 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 02:53:33,751 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 02:53:33,751 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 02:53:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:33,751 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:53:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:53:33,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:33,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:33,751 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 02:53:33,751 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 02:53:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:53:33,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:53:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:53:33,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:33,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:53:33,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:53:33,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:53:33,752 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 02:53:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:53:33,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 02:53:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:53:33,752 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:53:33,753 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 02:53:33,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:53:33,753 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 02:53:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:53:33,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:53:33,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:53:33,783 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 02:53:33,959 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 02:53:33,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:53:34,123 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 02:53:34,123 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 02:53:34,123 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 02:53:34,123 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 21) the Hoare annotation is: true [2022-04-28 02:53:34,123 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 21) the Hoare annotation is: true [2022-04-28 02:53:34,123 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 02:53:34,123 INFO L902 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: true [2022-04-28 02:53:34,123 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 02:53:34,123 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 02:53:34,123 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 21) the Hoare annotation is: true [2022-04-28 02:53:34,123 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 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 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 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 02:53:34,124 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 02:53:34,124 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 02:53:34,124 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 02:53:34,124 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 02:53:34,126 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2] [2022-04-28 02:53:34,127 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:53:34,129 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:53:34,131 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:53:34,136 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 02:53:34,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:53:34 BoogieIcfgContainer [2022-04-28 02:53:34,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:53:34,145 INFO L158 Benchmark]: Toolchain (without parser) took 6007.33ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 159.2MB in the beginning and 199.0MB in the end (delta: -39.8MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-04-28 02:53:34,145 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory was 175.3MB in the beginning and 175.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:53:34,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.90ms. Allocated memory is still 208.7MB. Free memory was 158.9MB in the beginning and 184.0MB in the end (delta: -25.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-28 02:53:34,146 INFO L158 Benchmark]: Boogie Preprocessor took 33.94ms. Allocated memory is still 208.7MB. Free memory was 184.0MB in the beginning and 182.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:53:34,146 INFO L158 Benchmark]: RCFGBuilder took 222.13ms. Allocated memory is still 208.7MB. Free memory was 182.3MB in the beginning and 171.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:53:34,146 INFO L158 Benchmark]: TraceAbstraction took 5533.52ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 171.4MB in the beginning and 199.0MB in the end (delta: -27.6MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2022-04-28 02:53:34,147 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.09ms. Allocated memory is still 208.7MB. Free memory was 175.3MB in the beginning and 175.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.90ms. Allocated memory is still 208.7MB. Free memory was 158.9MB in the beginning and 184.0MB in the end (delta: -25.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.94ms. Allocated memory is still 208.7MB. Free memory was 184.0MB in the beginning and 182.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.13ms. Allocated memory is still 208.7MB. Free memory was 182.3MB in the beginning and 171.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5533.52ms. Allocated memory was 208.7MB in the beginning and 265.3MB in the end (delta: 56.6MB). Free memory was 171.4MB in the beginning and 199.0MB in the end (delta: -27.6MB). Peak memory consumption was 30.5MB. 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.5s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.2s 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.5s 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 02:53:34,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_54,QUANTIFIED] [2022-04-28 02:53:34,153 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 02:53:34,177 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...