/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:01:52,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:01:52,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:01:52,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:01:52,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:01:52,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:01:52,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:01:52,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:01:52,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:01:52,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:01:52,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:01:52,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:01:52,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:01:52,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:01:52,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:01:52,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:01:52,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:01:52,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:01:52,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:01:52,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:01:52,475 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:01:52,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:01:52,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:01:52,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:01:52,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:01:52,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:01:52,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:01:52,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:01:52,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:01:52,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:01:52,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:01:52,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:01:52,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:01:52,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:01:52,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:01:52,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:01:52,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:01:52,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:01:52,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:01:52,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:01:52,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:01:52,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:01:52,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:01:52,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:01:52,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:01:52,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:01:52,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:01:52,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:01:52,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:01:52,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:01:52,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:01:52,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:01:52,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:01:52,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:01:52,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:01:52,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:52,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:01:52,503 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:01:52,504 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:01:52,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:01:52,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:01:52,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:01:52,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:01:52,708 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:01:52,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2022-04-08 09:01:52,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f57d033/819cbf7de46e4110b7e4f913f03dfed8/FLAG96f453f36 [2022-04-08 09:01:53,138 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:01:53,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2022-04-08 09:01:53,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f57d033/819cbf7de46e4110b7e4f913f03dfed8/FLAG96f453f36 [2022-04-08 09:01:53,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36f57d033/819cbf7de46e4110b7e4f913f03dfed8 [2022-04-08 09:01:53,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:01:53,170 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:01:53,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:53,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:01:53,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:01:53,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c70fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53, skipping insertion in model container [2022-04-08 09:01:53,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:01:53,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:01:53,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-08 09:01:53,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:53,416 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:01:53,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-08 09:01:53,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:53,444 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:01:53,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53 WrapperNode [2022-04-08 09:01:53,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:53,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:01:53,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:01:53,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:01:53,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:01:53,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:01:53,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:01:53,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:01:53,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (1/1) ... [2022-04-08 09:01:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:53,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:01:53,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:01:53,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:01:53,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:01:53,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:01:53,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:01:53,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:01:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:01:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:01:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:01:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:01:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:01:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:01:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:01:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:01:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:01:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:01:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:01:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:01:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:01:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:01:53,605 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:01:53,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:01:53,709 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:01:53,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:01:53,713 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:01:53,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:53 BoogieIcfgContainer [2022-04-08 09:01:53,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:01:53,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:01:53,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:01:53,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:01:53,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:01:53" (1/3) ... [2022-04-08 09:01:53,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:53, skipping insertion in model container [2022-04-08 09:01:53,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:53" (2/3) ... [2022-04-08 09:01:53,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:53, skipping insertion in model container [2022-04-08 09:01:53,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:53" (3/3) ... [2022-04-08 09:01:53,719 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2022-04-08 09:01:53,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:01:53,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:01:53,748 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:01:53,753 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:01:53,753 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:01:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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-08 09:01:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:01:53,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:53,774 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:53,774 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:53,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-08 09:01:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845516493] [2022-04-08 09:01:53,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:01:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-08 09:01:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730220564] [2022-04-08 09:01:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:53,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-08 09:01:53,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:53,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:01:53,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:53,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-08 09:01:53,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:53,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:01:53,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-08 09:01:53,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-08 09:01:53,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 09:01:53,911 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-08 09:01:53,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 09:01:53,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:01:53,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:01:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:53,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730220564] [2022-04-08 09:01:53,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730220564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:53,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:53,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:01:53,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845516493] [2022-04-08 09:01:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845516493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:53,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:01:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957141382] [2022-04-08 09:01:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:53,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 09:01:53,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:53,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:53,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:53,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:01:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:01:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:01:53,953 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,001 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-08 09:01:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:01:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 09:01:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:01:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:01:54,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-08 09:01:54,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:54,079 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:01:54,080 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:01:54,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:01:54,084 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:54,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:01:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:01:54,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:54,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-08 09:01:54,116 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-08 09:01:54,117 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-08 09:01:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,126 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:01:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:54,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-08 09:01:54,127 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-08 09:01:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,132 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:01:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:54,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:54,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-08 09:01:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 09:01:54,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 09:01:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:54,135 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 09:01:54,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 09:01:54,153 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-08 09:01:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:01:54,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:54,158 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:54,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:01:54,163 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-08 09:01:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619728703] [2022-04-08 09:01:54,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:01:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-08 09:01:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:54,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334187605] [2022-04-08 09:01:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:54,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {149#true} is VALID [2022-04-08 09:01:54,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:01:54,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:01:54,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:54,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {149#true} is VALID [2022-04-08 09:01:54,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:01:54,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:01:54,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret2 := main(); {149#true} is VALID [2022-04-08 09:01:54,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {154#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:54,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {150#false} is VALID [2022-04-08 09:01:54,267 INFO L272 TraceCheckUtils]: 7: Hoare triple {150#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {150#false} is VALID [2022-04-08 09:01:54,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-08 09:01:54,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:01:54,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:01:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334187605] [2022-04-08 09:01:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334187605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:54,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:54,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:01:54,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:54,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619728703] [2022-04-08 09:01:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619728703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:54,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:54,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:01:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830495237] [2022-04-08 09:01:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 09:01:54,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:54,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:54,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:01:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:01:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:01:54,284 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,364 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-08 09:01:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:01:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 09:01:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-08 09:01:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-08 09:01:54,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-08 09:01:54,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:54,395 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:01:54,395 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:01:54,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:01:54,399 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:54,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:01:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 09:01:54,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:54,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,420 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,420 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,422 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 09:01:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 09:01:54,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:01:54,424 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:01:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,425 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 09:01:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 09:01:54,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:54,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-08 09:01:54,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-08 09:01:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:54,429 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-08 09:01:54,429 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-08 09:01:54,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 09:01:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:01:54,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:54,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:54,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:01:54,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-08 09:01:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:54,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41883995] [2022-04-08 09:01:54,485 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:54,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 2 times [2022-04-08 09:01:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572825664] [2022-04-08 09:01:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:54,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {276#true} is VALID [2022-04-08 09:01:54,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-08 09:01:54,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-08 09:01:54,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:54,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {276#true} is VALID [2022-04-08 09:01:54,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-08 09:01:54,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-08 09:01:54,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2022-04-08 09:01:54,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {281#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:54,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {281#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:54,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {281#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:54,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {282#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:54,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 2)} assume !(~i~0 <= 8); {277#false} is VALID [2022-04-08 09:01:54,552 INFO L272 TraceCheckUtils]: 10: Hoare triple {277#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {277#false} is VALID [2022-04-08 09:01:54,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-08 09:01:54,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-08 09:01:54,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-08 09:01:54,553 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-08 09:01:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572825664] [2022-04-08 09:01:54,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572825664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180171021] [2022-04-08 09:01:54,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:54,556 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-08 09:01:54,574 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-08 09:01:54,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:54,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:54,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:01:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:54,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:54,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2022-04-08 09:01:54,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#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(10, 2); {276#true} is VALID [2022-04-08 09:01:54,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-08 09:01:54,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-08 09:01:54,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2022-04-08 09:01:54,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {302#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:54,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {302#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:54,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {302#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {302#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:54,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {282#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:54,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 2)} assume !(~i~0 <= 8); {277#false} is VALID [2022-04-08 09:01:54,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {277#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {277#false} is VALID [2022-04-08 09:01:54,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-08 09:01:54,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-08 09:01:54,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-08 09:01:54,726 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-08 09:01:54,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:54,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-08 09:01:54,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-08 09:01:54,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-08 09:01:54,806 INFO L272 TraceCheckUtils]: 10: Hoare triple {277#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {277#false} is VALID [2022-04-08 09:01:54,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {339#(<= main_~i~0 8)} assume !(~i~0 <= 8); {277#false} is VALID [2022-04-08 09:01:54,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {339#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:54,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#(<= main_~i~0 7)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {343#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:54,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {343#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:54,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {343#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:54,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2022-04-08 09:01:54,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-08 09:01:54,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-08 09:01:54,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#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(10, 2); {276#true} is VALID [2022-04-08 09:01:54,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2022-04-08 09:01:54,809 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-08 09:01:54,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180171021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:54,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:54,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:01:54,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41883995] [2022-04-08 09:01:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41883995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:01:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317883363] [2022-04-08 09:01:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:54,812 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-08 09:01:54,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:54,812 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-08 09:01:54,823 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-08 09:01:54,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:01:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:01:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:01:54,824 INFO L87 Difference]: Start difference. First operand 16 states and 17 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-08 09:01:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,898 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 09:01:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:01:54,898 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-08 09:01:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:54,898 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-08 09:01:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 09:01:54,902 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-08 09:01:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 09:01:54,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 09:01:54,928 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-08 09:01:54,929 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:01:54,929 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:01:54,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:01:54,931 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:54,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:01:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 09:01:54,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:54,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,941 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,942 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,944 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:01:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:01:54,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-08 09:01:54,945 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-08 09:01:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:54,946 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:01:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:01:54,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:54,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:54,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:54,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 09:01:54,952 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-08 09:01:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:54,952 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 09:01:54,952 INFO L479 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-08 09:01:54,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 09:01:54,977 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-08 09:01:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 09:01:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:01:54,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:54,978 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:55,001 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-08 09:01:55,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:55,193 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 473295148, now seen corresponding path program 3 times [2022-04-08 09:01:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:55,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152510620] [2022-04-08 09:01:55,202 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:55,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 473295148, now seen corresponding path program 4 times [2022-04-08 09:01:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809771243] [2022-04-08 09:01:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:55,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {508#true} is VALID [2022-04-08 09:01:55,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-08 09:01:55,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #47#return; {508#true} is VALID [2022-04-08 09:01:55,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:55,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {508#true} is VALID [2022-04-08 09:01:55,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2022-04-08 09:01:55,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #47#return; {508#true} is VALID [2022-04-08 09:01:55,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret2 := main(); {508#true} is VALID [2022-04-08 09:01:55,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {508#true} is VALID [2022-04-08 09:01:55,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#true} assume !!(~i~0 <= 8); {508#true} is VALID [2022-04-08 09:01:55,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {508#true} is VALID [2022-04-08 09:01:55,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {508#true} is VALID [2022-04-08 09:01:55,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} assume !!(~i~0 <= 8); {508#true} is VALID [2022-04-08 09:01:55,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {513#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {514#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:55,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#(<= main_~i~0 4)} assume !(~i~0 <= 8); {509#false} is VALID [2022-04-08 09:01:55,256 INFO L272 TraceCheckUtils]: 13: Hoare triple {509#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {509#false} is VALID [2022-04-08 09:01:55,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#false} ~cond := #in~cond; {509#false} is VALID [2022-04-08 09:01:55,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {509#false} assume 0 == ~cond; {509#false} is VALID [2022-04-08 09:01:55,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-04-08 09:01:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:01:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:55,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809771243] [2022-04-08 09:01:55,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809771243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:55,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:55,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:01:55,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152510620] [2022-04-08 09:01:55,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152510620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:55,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:55,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:01:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739966971] [2022-04-08 09:01:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:55,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 17 [2022-04-08 09:01:55,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:55,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-08 09:01:55,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:55,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:01:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:01:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:01:55,269 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-08 09:01:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,353 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-08 09:01:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:01:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 17 [2022-04-08 09:01:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-08 09:01:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 09:01:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-08 09:01:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-08 09:01:55,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-08 09:01:55,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:55,385 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:01:55,385 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:01:55,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:01:55,386 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:55,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:01:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-08 09:01:55,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:55,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:55,398 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:55,398 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,399 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 09:01:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 09:01:55,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:55,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:55,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 23 states. [2022-04-08 09:01:55,400 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 23 states. [2022-04-08 09:01:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,401 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 09:01:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 09:01:55,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:55,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:55,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:55,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-08 09:01:55,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2022-04-08 09:01:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:55,402 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-08 09:01:55,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-08 09:01:55,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-08 09:01:55,422 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-08 09:01:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:01:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:01:55,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:55,422 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:55,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:01:55,423 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 1 times [2022-04-08 09:01:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:55,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776935485] [2022-04-08 09:01:55,432 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:55,433 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 2 times [2022-04-08 09:01:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:55,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108648144] [2022-04-08 09:01:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:55,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {667#true} is VALID [2022-04-08 09:01:55,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#true} assume true; {667#true} is VALID [2022-04-08 09:01:55,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {667#true} {667#true} #47#return; {667#true} is VALID [2022-04-08 09:01:55,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:55,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {667#true} is VALID [2022-04-08 09:01:55,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2022-04-08 09:01:55,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #47#return; {667#true} is VALID [2022-04-08 09:01:55,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret2 := main(); {667#true} is VALID [2022-04-08 09:01:55,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {672#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:55,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {672#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:55,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {672#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {672#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:55,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {672#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(<= main_~i~0 3)} assume !(~i~0 < 4); {668#false} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {668#false} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#false} assume !(~i~0 <= 8); {668#false} is VALID [2022-04-08 09:01:55,486 INFO L272 TraceCheckUtils]: 16: Hoare triple {668#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {668#false} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2022-04-08 09:01:55,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-08 09:01:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:55,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108648144] [2022-04-08 09:01:55,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108648144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:55,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916840781] [2022-04-08 09:01:55,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:55,503 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-08 09:01:55,537 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-08 09:01:55,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:55,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:55,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:01:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:55,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:55,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2022-04-08 09:01:55,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#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(10, 2); {667#true} is VALID [2022-04-08 09:01:55,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2022-04-08 09:01:55,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #47#return; {667#true} is VALID [2022-04-08 09:01:55,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret2 := main(); {667#true} is VALID [2022-04-08 09:01:55,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {694#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {694#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {694#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(<= main_~i~0 3)} assume !(~i~0 < 4); {668#false} is VALID [2022-04-08 09:01:55,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {668#false} is VALID [2022-04-08 09:01:55,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#false} assume !(~i~0 <= 8); {668#false} is VALID [2022-04-08 09:01:55,690 INFO L272 TraceCheckUtils]: 16: Hoare triple {668#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {668#false} is VALID [2022-04-08 09:01:55,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2022-04-08 09:01:55,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2022-04-08 09:01:55,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-08 09:01:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:55,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:55,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-04-08 09:01:55,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2022-04-08 09:01:55,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2022-04-08 09:01:55,783 INFO L272 TraceCheckUtils]: 16: Hoare triple {668#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {668#false} is VALID [2022-04-08 09:01:55,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#false} assume !(~i~0 <= 8); {668#false} is VALID [2022-04-08 09:01:55,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {668#false} is VALID [2022-04-08 09:01:55,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(<= main_~i~0 3)} assume !(~i~0 < 4); {668#false} is VALID [2022-04-08 09:01:55,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {674#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:55,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {694#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {673#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:55,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {694#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {694#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {694#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:55,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret2 := main(); {667#true} is VALID [2022-04-08 09:01:55,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #47#return; {667#true} is VALID [2022-04-08 09:01:55,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2022-04-08 09:01:55,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#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(10, 2); {667#true} is VALID [2022-04-08 09:01:55,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2022-04-08 09:01:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:55,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916840781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:55,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:55,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-08 09:01:55,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:55,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776935485] [2022-04-08 09:01:55,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776935485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:55,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:55,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:01:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249690927] [2022-04-08 09:01:55,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:55,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:55,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,806 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-08 09:01:55,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:01:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:01:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:01:55,806 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,905 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 09:01:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:01:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:01:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:01:55,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-08 09:01:55,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:55,941 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:01:55,941 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:01:55,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:01:55,942 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:55,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:01:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 09:01:55,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:55,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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-08 09:01:55,955 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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-08 09:01:55,955 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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-08 09:01:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,956 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-08 09:01:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-08 09:01:55,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:55,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:55,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 24 states. [2022-04-08 09:01:55,957 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 24 states. [2022-04-08 09:01:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:55,958 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-04-08 09:01:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-08 09:01:55,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:55,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:55,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:55,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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-08 09:01:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-08 09:01:55,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2022-04-08 09:01:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:55,959 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-08 09:01:55,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:01:55,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-08 09:01:55,978 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-08 09:01:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-08 09:01:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:01:55,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:55,979 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:55,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 09:01:56,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:56,195 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 3 times [2022-04-08 09:01:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:56,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288770993] [2022-04-08 09:01:56,205 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:56,205 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 4 times [2022-04-08 09:01:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:56,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108975127] [2022-04-08 09:01:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:56,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {966#true} is VALID [2022-04-08 09:01:56,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 09:01:56,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #47#return; {966#true} is VALID [2022-04-08 09:01:56,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:56,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {966#true} is VALID [2022-04-08 09:01:56,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 09:01:56,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #47#return; {966#true} is VALID [2022-04-08 09:01:56,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-08 09:01:56,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {971#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:56,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {971#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:56,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {971#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:56,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {972#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {973#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {973#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {974#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {974#(<= main_~i~0 4)} assume !(~i~0 < 4); {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {974#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {975#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:56,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {975#(<= main_~i~0 5)} assume !(~i~0 <= 8); {967#false} is VALID [2022-04-08 09:01:56,308 INFO L272 TraceCheckUtils]: 19: Hoare triple {967#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {967#false} is VALID [2022-04-08 09:01:56,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 09:01:56,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 09:01:56,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 09:01:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108975127] [2022-04-08 09:01:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108975127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582869207] [2022-04-08 09:01:56,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:56,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:56,310 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-08 09:01:56,312 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-08 09:01:56,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:56,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:56,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:01:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:56,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:56,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-08 09:01:56,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#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(10, 2); {966#true} is VALID [2022-04-08 09:01:56,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 09:01:56,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #47#return; {966#true} is VALID [2022-04-08 09:01:56,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-08 09:01:56,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {995#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:56,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {995#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {995#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:56,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {995#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {995#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:56,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {972#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {972#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:56,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {973#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {973#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:56,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {973#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {974#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {974#(<= main_~i~0 4)} assume !(~i~0 < 4); {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {974#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {975#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:56,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {975#(<= main_~i~0 5)} assume !(~i~0 <= 8); {967#false} is VALID [2022-04-08 09:01:56,467 INFO L272 TraceCheckUtils]: 19: Hoare triple {967#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {967#false} is VALID [2022-04-08 09:01:56,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 09:01:56,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 09:01:56,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 09:01:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:56,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:56,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-08 09:01:56,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-08 09:01:56,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-08 09:01:56,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {967#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {967#false} is VALID [2022-04-08 09:01:56,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1059#(<= main_~i~0 8)} assume !(~i~0 <= 8); {967#false} is VALID [2022-04-08 09:01:56,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {1063#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1059#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:56,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {1063#(<= main_~i~0 7)} assume !(~i~0 < 4); {1063#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:56,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1063#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:56,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1063#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:56,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {1073#(<= main_~i~0 6)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1073#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:56,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1073#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1073#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:56,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {975#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1073#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:56,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {975#(<= main_~i~0 5)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {975#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:56,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {975#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:56,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {974#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {975#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:56,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {974#(<= main_~i~0 4)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {974#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {974#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:56,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2022-04-08 09:01:56,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #47#return; {966#true} is VALID [2022-04-08 09:01:56,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-08 09:01:56,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#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(10, 2); {966#true} is VALID [2022-04-08 09:01:56,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-08 09:01:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:56,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582869207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:56,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:56,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-08 09:01:56,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288770993] [2022-04-08 09:01:56,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288770993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:56,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:56,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:01:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796125812] [2022-04-08 09:01:56,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2022-04-08 09:01:56,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:56,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,632 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-08 09:01:56,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:01:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:01:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:01:56,634 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:56,778 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 09:01:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:01:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2022-04-08 09:01:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 09:01:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 09:01:56,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-08 09:01:56,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:56,806 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:01:56,806 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:01:56,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:01:56,814 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:56,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 23 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:01:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-08 09:01:56,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:56,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,831 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,831 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:56,832 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:01:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-08 09:01:56,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:56,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:56,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 29 states. [2022-04-08 09:01:56,832 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 29 states. [2022-04-08 09:01:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:56,833 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:01:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-08 09:01:56,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:56,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:56,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:56,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-08 09:01:56,834 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-08 09:01:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:56,835 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-08 09:01:56,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:56,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-08 09:01:56,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 09:01:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:01:56,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:56,866 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:56,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:01:57,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:57,082 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1841039991, now seen corresponding path program 5 times [2022-04-08 09:01:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:57,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390689173] [2022-04-08 09:01:57,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:57,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1841039991, now seen corresponding path program 6 times [2022-04-08 09:01:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281164377] [2022-04-08 09:01:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:57,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {1319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1308#true} is VALID [2022-04-08 09:01:57,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 09:01:57,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #47#return; {1308#true} is VALID [2022-04-08 09:01:57,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:57,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1308#true} is VALID [2022-04-08 09:01:57,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 09:01:57,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #47#return; {1308#true} is VALID [2022-04-08 09:01:57,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret2 := main(); {1308#true} is VALID [2022-04-08 09:01:57,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1313#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:57,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {1313#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:57,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1313#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:57,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1314#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:57,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {1314#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1314#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:57,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {1314#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1314#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:57,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {1314#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1315#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:57,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1315#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:57,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1315#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:57,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {1316#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1316#(<= main_~i~0 4)} assume !(~i~0 < 4); {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {1316#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1317#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1317#(<= main_~i~0 5)} assume !(~i~0 < 4); {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {1317#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {1318#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1309#false} is VALID [2022-04-08 09:01:57,163 INFO L272 TraceCheckUtils]: 22: Hoare triple {1309#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1309#false} is VALID [2022-04-08 09:01:57,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {1309#false} ~cond := #in~cond; {1309#false} is VALID [2022-04-08 09:01:57,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {1309#false} assume 0 == ~cond; {1309#false} is VALID [2022-04-08 09:01:57,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-08 09:01:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281164377] [2022-04-08 09:01:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281164377] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046780453] [2022-04-08 09:01:57,164 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:57,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:57,165 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-08 09:01:57,166 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-08 09:01:57,194 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 09:01:57,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:57,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:01:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:57,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:57,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1308#true} is VALID [2022-04-08 09:01:57,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#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(10, 2); {1308#true} is VALID [2022-04-08 09:01:57,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #47#return; {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret2 := main(); {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !!(~i~0 <= 8); {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1308#true} is VALID [2022-04-08 09:01:57,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !!(~i~0 <= 8); {1308#true} is VALID [2022-04-08 09:01:57,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {1308#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1315#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:57,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {1315#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1316#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1316#(<= main_~i~0 4)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1316#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1317#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1317#(<= main_~i~0 5)} assume !(~i~0 < 4); {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {1317#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1318#(<= main_~i~0 6)} assume !(~i~0 < 4); {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1318#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1383#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:57,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1383#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1309#false} is VALID [2022-04-08 09:01:57,320 INFO L272 TraceCheckUtils]: 22: Hoare triple {1309#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1309#false} is VALID [2022-04-08 09:01:57,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1309#false} ~cond := #in~cond; {1309#false} is VALID [2022-04-08 09:01:57,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1309#false} assume 0 == ~cond; {1309#false} is VALID [2022-04-08 09:01:57,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-08 09:01:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:01:57,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:57,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-08 09:01:57,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {1309#false} assume 0 == ~cond; {1309#false} is VALID [2022-04-08 09:01:57,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1309#false} ~cond := #in~cond; {1309#false} is VALID [2022-04-08 09:01:57,441 INFO L272 TraceCheckUtils]: 22: Hoare triple {1309#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1309#false} is VALID [2022-04-08 09:01:57,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1411#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1309#false} is VALID [2022-04-08 09:01:57,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {1383#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1411#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:57,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {1383#(<= main_~i~0 7)} assume !(~i~0 < 4); {1383#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:57,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {1383#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1383#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:57,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {1318#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1383#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:57,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#(<= main_~i~0 6)} assume !(~i~0 < 4); {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1318#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {1317#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1318#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:57,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1317#(<= main_~i~0 5)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1317#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1316#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1317#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1308#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1316#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !!(~i~0 <= 8); {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !!(~i~0 <= 8); {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret2 := main(); {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #47#return; {1308#true} is VALID [2022-04-08 09:01:57,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 09:01:57,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#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(10, 2); {1308#true} is VALID [2022-04-08 09:01:57,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1308#true} is VALID [2022-04-08 09:01:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:01:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046780453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:57,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:57,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2022-04-08 09:01:57,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:57,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390689173] [2022-04-08 09:01:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390689173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:57,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:57,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:01:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293552899] [2022-04-08 09:01:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-08 09:01:57,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:57,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:57,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:01:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:01:57,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:01:57,466 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:57,621 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 09:01:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:01:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-08 09:01:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 09:01:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 09:01:57,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-08 09:01:57,652 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-08 09:01:57,652 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:01:57,652 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 09:01:57,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:01:57,653 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:57,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 33 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 09:01:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-08 09:01:57,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:57,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,672 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,672 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:57,673 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-08 09:01:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-08 09:01:57,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:57,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:57,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 32 states. [2022-04-08 09:01:57,673 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 32 states. [2022-04-08 09:01:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:57,674 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-08 09:01:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-08 09:01:57,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:57,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:57,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:57,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-08 09:01:57,675 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2022-04-08 09:01:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:57,676 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-08 09:01:57,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:57,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-08 09:01:57,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 09:01:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:01:57,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:57,707 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:57,723 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-08 09:01:57,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:57,923 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -660550482, now seen corresponding path program 7 times [2022-04-08 09:01:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:57,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403095826] [2022-04-08 09:01:57,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:57,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash -660550482, now seen corresponding path program 8 times [2022-04-08 09:01:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338170736] [2022-04-08 09:01:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1687#true} is VALID [2022-04-08 09:01:58,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 09:01:58,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #47#return; {1687#true} is VALID [2022-04-08 09:01:58,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:58,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1687#true} is VALID [2022-04-08 09:01:58,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 09:01:58,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #47#return; {1687#true} is VALID [2022-04-08 09:01:58,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2022-04-08 09:01:58,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1692#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {1692#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {1692#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1692#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1693#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(<= main_~i~0 4)} assume !(~i~0 < 4); {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {1695#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {1696#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {1696#(<= main_~i~0 5)} assume !(~i~0 < 4); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {1696#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {1697#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {1697#(<= main_~i~0 6)} assume !(~i~0 < 4); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {1697#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1698#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {1698#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1688#false} is VALID [2022-04-08 09:01:58,027 INFO L272 TraceCheckUtils]: 25: Hoare triple {1688#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1688#false} is VALID [2022-04-08 09:01:58,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2022-04-08 09:01:58,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2022-04-08 09:01:58,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 09:01:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:58,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:58,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338170736] [2022-04-08 09:01:58,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338170736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:58,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587323092] [2022-04-08 09:01:58,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:58,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:58,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:58,029 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-08 09:01:58,030 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-08 09:01:58,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:58,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:58,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:01:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:58,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-08 09:01:58,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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(10, 2); {1687#true} is VALID [2022-04-08 09:01:58,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 09:01:58,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #47#return; {1687#true} is VALID [2022-04-08 09:01:58,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2022-04-08 09:01:58,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1718#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:58,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {1718#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1718#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:58,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1718#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:58,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {1693#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(<= main_~i~0 4)} assume !(~i~0 < 4); {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1695#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1696#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1696#(<= main_~i~0 5)} assume !(~i~0 < 4); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1696#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {1697#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1697#(<= main_~i~0 6)} assume !(~i~0 < 4); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1697#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1698#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {1698#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1688#false} is VALID [2022-04-08 09:01:58,212 INFO L272 TraceCheckUtils]: 25: Hoare triple {1688#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1688#false} is VALID [2022-04-08 09:01:58,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2022-04-08 09:01:58,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2022-04-08 09:01:58,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 09:01:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:58,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:58,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-08 09:01:58,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2022-04-08 09:01:58,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2022-04-08 09:01:58,374 INFO L272 TraceCheckUtils]: 25: Hoare triple {1688#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1688#false} is VALID [2022-04-08 09:01:58,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {1800#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1688#false} is VALID [2022-04-08 09:01:58,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {1698#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1800#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:58,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {1698#(<= main_~i~0 7)} assume !(~i~0 < 4); {1698#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {1698#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1698#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {1697#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1698#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {1697#(<= main_~i~0 6)} assume !(~i~0 < 4); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {1697#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {1696#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1697#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {1696#(<= main_~i~0 5)} assume !(~i~0 < 4); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {1696#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1696#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {1695#(<= main_~i~0 4)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1695#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1694#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {1693#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1694#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1693#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {1693#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1693#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2022-04-08 09:01:58,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #47#return; {1687#true} is VALID [2022-04-08 09:01:58,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-08 09:01:58,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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(10, 2); {1687#true} is VALID [2022-04-08 09:01:58,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-08 09:01:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587323092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:58,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:58,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-08 09:01:58,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:58,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403095826] [2022-04-08 09:01:58,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403095826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:58,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:58,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:01:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025811876] [2022-04-08 09:01:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-08 09:01:58,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:58,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:58,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:01:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:01:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:01:58,413 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:58,548 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 09:01:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:01:58,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-08 09:01:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-08 09:01:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-08 09:01:58,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-04-08 09:01:58,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:58,573 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:01:58,573 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:01:58,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:01:58,574 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:58,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 23 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:01:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 09:01:58,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:58,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,590 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,591 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:58,592 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 09:01:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-08 09:01:58,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:58,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:58,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 35 states. [2022-04-08 09:01:58,597 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 35 states. [2022-04-08 09:01:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:58,598 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 09:01:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-08 09:01:58,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:58,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:58,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:58,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 09:01:58,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 29 [2022-04-08 09:01:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:58,600 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 09:01:58,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:58,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 09:01:58,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 09:01:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:01:58,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:58,624 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:58,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 09:01:58,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:58,840 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 110192489, now seen corresponding path program 9 times [2022-04-08 09:01:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151845933] [2022-04-08 09:01:58,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:58,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 110192489, now seen corresponding path program 10 times [2022-04-08 09:01:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:58,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685902923] [2022-04-08 09:01:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {2118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2105#true} assume true; {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2105#true} {2105#true} #47#return; {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {2105#true} call ULTIMATE.init(); {2118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:58,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {2105#true} assume true; {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2105#true} {2105#true} #47#return; {2105#true} is VALID [2022-04-08 09:01:58,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {2105#true} call #t~ret2 := main(); {2105#true} is VALID [2022-04-08 09:01:58,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {2105#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2110#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {2110#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8); {2110#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {2110#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2110#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:01:58,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {2110#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:58,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:58,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {2113#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {2113#(<= main_~i~0 4)} assume !(~i~0 < 4); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:58,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {2114#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {2114#(<= main_~i~0 5)} assume !(~i~0 < 4); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:58,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {2114#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {2115#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {2115#(<= main_~i~0 6)} assume !(~i~0 < 4); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:58,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {2116#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {2116#(<= main_~i~0 7)} assume !(~i~0 < 4); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:58,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {2116#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2117#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:58,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {2117#(<= main_~i~0 8)} assume !(~i~0 <= 8); {2106#false} is VALID [2022-04-08 09:01:58,929 INFO L272 TraceCheckUtils]: 28: Hoare triple {2106#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2106#false} is VALID [2022-04-08 09:01:58,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {2106#false} ~cond := #in~cond; {2106#false} is VALID [2022-04-08 09:01:58,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {2106#false} assume 0 == ~cond; {2106#false} is VALID [2022-04-08 09:01:58,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {2106#false} assume !false; {2106#false} is VALID [2022-04-08 09:01:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:58,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685902923] [2022-04-08 09:01:58,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685902923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:58,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197170637] [2022-04-08 09:01:58,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:58,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:58,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:58,944 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-08 09:01:58,957 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-08 09:01:58,982 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:58,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:58,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:01:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:58,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:59,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {2105#true} call ULTIMATE.init(); {2105#true} is VALID [2022-04-08 09:01:59,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {2105#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(10, 2); {2105#true} is VALID [2022-04-08 09:01:59,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2105#true} assume true; {2105#true} is VALID [2022-04-08 09:01:59,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2105#true} {2105#true} #47#return; {2105#true} is VALID [2022-04-08 09:01:59,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {2105#true} call #t~ret2 := main(); {2105#true} is VALID [2022-04-08 09:01:59,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2105#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {2137#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {2137#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {2113#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {2113#(<= main_~i~0 4)} assume !(~i~0 < 4); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {2114#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {2114#(<= main_~i~0 5)} assume !(~i~0 < 4); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {2114#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {2115#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {2115#(<= main_~i~0 6)} assume !(~i~0 < 4); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {2116#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {2116#(<= main_~i~0 7)} assume !(~i~0 < 4); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {2116#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2117#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:59,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {2117#(<= main_~i~0 8)} assume !(~i~0 <= 8); {2106#false} is VALID [2022-04-08 09:01:59,113 INFO L272 TraceCheckUtils]: 28: Hoare triple {2106#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2106#false} is VALID [2022-04-08 09:01:59,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {2106#false} ~cond := #in~cond; {2106#false} is VALID [2022-04-08 09:01:59,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {2106#false} assume 0 == ~cond; {2106#false} is VALID [2022-04-08 09:01:59,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {2106#false} assume !false; {2106#false} is VALID [2022-04-08 09:01:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:59,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:59,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {2106#false} assume !false; {2106#false} is VALID [2022-04-08 09:01:59,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {2106#false} assume 0 == ~cond; {2106#false} is VALID [2022-04-08 09:01:59,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {2106#false} ~cond := #in~cond; {2106#false} is VALID [2022-04-08 09:01:59,238 INFO L272 TraceCheckUtils]: 28: Hoare triple {2106#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2106#false} is VALID [2022-04-08 09:01:59,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {2117#(<= main_~i~0 8)} assume !(~i~0 <= 8); {2106#false} is VALID [2022-04-08 09:01:59,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {2116#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2117#(<= main_~i~0 8)} is VALID [2022-04-08 09:01:59,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {2116#(<= main_~i~0 7)} assume !(~i~0 < 4); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {2116#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2116#(<= main_~i~0 7)} is VALID [2022-04-08 09:01:59,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {2115#(<= main_~i~0 6)} assume !(~i~0 < 4); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {2115#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {2114#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2115#(<= main_~i~0 6)} is VALID [2022-04-08 09:01:59,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {2114#(<= main_~i~0 5)} assume !(~i~0 < 4); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {2114#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {2113#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2114#(<= main_~i~0 5)} is VALID [2022-04-08 09:01:59,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {2113#(<= main_~i~0 4)} assume !(~i~0 < 4); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {2113#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2113#(<= main_~i~0 4)} is VALID [2022-04-08 09:01:59,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2112#(<= main_~i~0 3)} is VALID [2022-04-08 09:01:59,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {2137#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2111#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:59,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {2137#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {2105#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2137#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:59,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {2105#true} call #t~ret2 := main(); {2105#true} is VALID [2022-04-08 09:01:59,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2105#true} {2105#true} #47#return; {2105#true} is VALID [2022-04-08 09:01:59,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2105#true} assume true; {2105#true} is VALID [2022-04-08 09:01:59,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2105#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(10, 2); {2105#true} is VALID [2022-04-08 09:01:59,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {2105#true} call ULTIMATE.init(); {2105#true} is VALID [2022-04-08 09:01:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197170637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:59,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:59,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2022-04-08 09:01:59,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151845933] [2022-04-08 09:01:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151845933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:59,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:59,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:01:59,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275213723] [2022-04-08 09:01:59,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-08 09:01:59,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:59,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,263 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-08 09:01:59,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:01:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:01:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:01:59,264 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:59,421 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-08 09:01:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:01:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-08 09:01:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 09:01:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-08 09:01:59,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-08 09:01:59,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:59,457 INFO L225 Difference]: With dead ends: 41 [2022-04-08 09:01:59,457 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 09:01:59,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:01:59,458 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:59,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 33 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:01:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 09:01:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 09:01:59,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:59,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,481 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,481 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:59,499 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 09:01:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 09:01:59,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:59,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:59,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-08 09:01:59,499 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-08 09:01:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:59,500 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 09:01:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 09:01:59,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:59,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:59,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:59,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-08 09:01:59,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2022-04-08 09:01:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:59,501 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-08 09:01:59,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:59,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 41 transitions. [2022-04-08 09:01:59,528 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-08 09:01:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 09:01:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 09:01:59,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:59,529 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:59,545 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-08 09:01:59,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:59,745 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 418877134, now seen corresponding path program 11 times [2022-04-08 09:01:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:59,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937512581] [2022-04-08 09:01:59,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:59,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 418877134, now seen corresponding path program 12 times [2022-04-08 09:01:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274055851] [2022-04-08 09:01:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:59,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:01:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:59,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:01:59,798 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:01:59,798 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:01:59,800 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:01:59,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 09:01:59,807 INFO L719 BasicCegarLoop]: Path program histogram: [12, 4, 2, 2] [2022-04-08 09:01:59,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:59,819 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:01:59,820 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:01:59,820 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:01:59,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:01:59 BoogieIcfgContainer [2022-04-08 09:01:59,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:01:59,823 INFO L158 Benchmark]: Toolchain (without parser) took 6653.37ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 131.0MB in the beginning and 198.3MB in the end (delta: -67.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:01:59,823 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:01:59,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 158.1MB in the end (delta: -27.3MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-08 09:01:59,824 INFO L158 Benchmark]: Boogie Preprocessor took 39.35ms. Allocated memory is still 184.5MB. Free memory was 158.1MB in the beginning and 156.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:01:59,824 INFO L158 Benchmark]: RCFGBuilder took 228.43ms. Allocated memory is still 184.5MB. Free memory was 156.5MB in the beginning and 146.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:01:59,824 INFO L158 Benchmark]: TraceAbstraction took 6106.88ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 145.5MB in the beginning and 198.3MB in the end (delta: -52.8MB). Peak memory consumption was 913.1kB. Max. memory is 8.0GB. [2022-04-08 09:01:59,828 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.16ms. Allocated memory is still 184.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 158.1MB in the end (delta: -27.3MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.35ms. Allocated memory is still 184.5MB. Free memory was 158.1MB in the beginning and 156.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.43ms. Allocated memory is still 184.5MB. Free memory was 156.5MB in the beginning and 146.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6106.88ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 145.5MB in the beginning and 198.3MB in the end (delta: -52.8MB). Peak memory consumption was 913.1kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, sn=0; [L24] i=1 [L24] COND TRUE i<=8 [L25] COND TRUE i<4 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=8 [L25] COND TRUE i<4 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=8 [L25] COND TRUE i<4 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=8 [L25] COND FALSE !(i<4) [L24] i++ [L24] COND TRUE i<=8 [L25] COND FALSE !(i<4) [L24] i++ [L24] COND TRUE i<=8 [L25] COND FALSE !(i<4) [L24] i++ [L24] COND TRUE i<=8 [L25] COND FALSE !(i<4) [L24] i++ [L24] COND TRUE i<=8 [L25] COND FALSE !(i<4) [L24] i++ [L24] COND FALSE !(i<=8) [L28] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 111 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=9, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 09:01:59,862 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...