/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-cav19/array_tiling_poly6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:03:57,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:03:57,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:03:57,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:03:57,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:03:57,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:03:57,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:03:57,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:03:57,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:03:57,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:03:57,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:03:57,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:03:57,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:03:57,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:03:57,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:03:57,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:03:57,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:03:57,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:03:57,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:03:57,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:03:57,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:03:57,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:03:57,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:03:57,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:03:57,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:03:57,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:03:57,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:03:57,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:03:57,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:03:57,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:03:57,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:03:57,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:03:57,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:03:57,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:03:57,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:03:57,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:03:57,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:03:57,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:03:57,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:03:57,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:03:57,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:03:57,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:03:57,856 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:03:57,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:03:57,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:03:57,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:03:57,859 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:03:57,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:03:57,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:03:57,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:03:57,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:03:57,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:03:57,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:03:57,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:03:57,861 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:03:57,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:03:57,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:03:57,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:03:57,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:03:57,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:03:57,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:03:57,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:03:57,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:03:57,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:03:57,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:03:57,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:03:57,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:03:57,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2021-01-06 11:03:58,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:03:58,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:03:58,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:03:58,325 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:03:58,326 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:03:58,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2021-01-06 11:03:58,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bab111552/ec23aa7bd147411ea67e75e655434ef3/FLAGddac5233c [2021-01-06 11:03:59,047 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:03:59,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2021-01-06 11:03:59,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bab111552/ec23aa7bd147411ea67e75e655434ef3/FLAGddac5233c [2021-01-06 11:03:59,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bab111552/ec23aa7bd147411ea67e75e655434ef3 [2021-01-06 11:03:59,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:03:59,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:03:59,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:03:59,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:03:59,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:03:59,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2fbfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59, skipping insertion in model container [2021-01-06 11:03:59,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:03:59,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 11:03:59,628 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~a~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~a~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 11:03:59,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:03:59,668 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 11:03:59,685 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 11:03:59,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:03:59,716 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:03:59,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59 WrapperNode [2021-01-06 11:03:59,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:03:59,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:03:59,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:03:59,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:03:59,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:03:59,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:03:59,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:03:59,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:03:59,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... [2021-01-06 11:03:59,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:03:59,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:03:59,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:03:59,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:03:59,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:03:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:03:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:03:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:03:59,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:03:59,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:03:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:03:59,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 11:04:00,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:04:00,403 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-01-06 11:04:00,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:04:00 BoogieIcfgContainer [2021-01-06 11:04:00,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:04:00,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:04:00,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:04:00,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:04:00,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:03:59" (1/3) ... [2021-01-06 11:04:00,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18615fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:04:00, skipping insertion in model container [2021-01-06 11:04:00,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:03:59" (2/3) ... [2021-01-06 11:04:00,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18615fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:04:00, skipping insertion in model container [2021-01-06 11:04:00,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:04:00" (3/3) ... [2021-01-06 11:04:00,430 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2021-01-06 11:04:00,439 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:04:00,444 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:04:00,468 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:04:00,517 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:04:00,518 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:04:00,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:04:00,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:04:00,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:04:00,519 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:04:00,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:04:00,519 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:04:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2021-01-06 11:04:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 11:04:00,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:00,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:00,555 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2021-01-06 11:04:00,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:00,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855662576] [2021-01-06 11:04:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:04:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:04:00,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855662576] [2021-01-06 11:04:00,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:04:00,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:04:00,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145220607] [2021-01-06 11:04:00,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 11:04:00,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 11:04:00,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:04:00,833 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2021-01-06 11:04:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:00,855 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-01-06 11:04:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 11:04:00,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2021-01-06 11:04:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:00,868 INFO L225 Difference]: With dead ends: 37 [2021-01-06 11:04:00,868 INFO L226 Difference]: Without dead ends: 16 [2021-01-06 11:04:00,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:04:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-01-06 11:04:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-01-06 11:04:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-01-06 11:04:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-01-06 11:04:00,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2021-01-06 11:04:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:00,913 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-01-06 11:04:00,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 11:04:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-01-06 11:04:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 11:04:00,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:00,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:00,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:04:00,915 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2021-01-06 11:04:00,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:00,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325044197] [2021-01-06 11:04:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:04:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:04:01,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325044197] [2021-01-06 11:04:01,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:04:01,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:04:01,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660390275] [2021-01-06 11:04:01,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:04:01,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:04:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:04:01,061 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2021-01-06 11:04:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:01,214 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-01-06 11:04:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:04:01,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-06 11:04:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:01,217 INFO L225 Difference]: With dead ends: 39 [2021-01-06 11:04:01,217 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 11:04:01,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:04:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 11:04:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2021-01-06 11:04:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-01-06 11:04:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-01-06 11:04:01,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2021-01-06 11:04:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:01,224 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-01-06 11:04:01,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:04:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-01-06 11:04:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 11:04:01,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:01,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:01,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:04:01,226 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2021-01-06 11:04:01,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:01,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045900589] [2021-01-06 11:04:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:01,245 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:04:01,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537065364] [2021-01-06 11:04:01,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:04:01,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:04:01,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:04:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:04:01,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045900589] [2021-01-06 11:04:01,460 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:04:01,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537065364] [2021-01-06 11:04:01,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:04:01,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-06 11:04:01,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951383247] [2021-01-06 11:04:01,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:04:01,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:04:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:04:01,464 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2021-01-06 11:04:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:01,674 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-01-06 11:04:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:04:01,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-06 11:04:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:01,676 INFO L225 Difference]: With dead ends: 47 [2021-01-06 11:04:01,676 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 11:04:01,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:04:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 11:04:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2021-01-06 11:04:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-01-06 11:04:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-01-06 11:04:01,694 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-01-06 11:04:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:01,695 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-01-06 11:04:01,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:04:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-01-06 11:04:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 11:04:01,696 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:01,698 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:01,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 11:04:01,913 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 2 times [2021-01-06 11:04:01,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:01,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335013439] [2021-01-06 11:04:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:01,931 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:04:01,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251278724] [2021-01-06 11:04:01,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:01,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 11:04:01,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:04:02,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-06 11:04:02,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:04:02,096 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-01-06 11:04:02,097 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:02,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:02,111 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:04:02,112 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-01-06 11:04:02,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:04:02,189 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-01-06 11:04:02,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:02,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:02,210 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:02,211 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-01-06 11:04:02,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:04:02,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 11:04:02,414 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:02,415 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2021-01-06 11:04:02,426 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:02,453 INFO L625 ElimStorePlain]: treesize reduction 15, result has 74.1 percent of original size [2021-01-06 11:04:02,463 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:02,463 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2021-01-06 11:04:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:04:02,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:04:02,585 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:02,586 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 108 [2021-01-06 11:04:02,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:02,670 INFO L625 ElimStorePlain]: treesize reduction 28, result has 72.3 percent of original size [2021-01-06 11:04:02,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:02,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:02,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:02,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:73 [2021-01-06 11:04:02,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:02,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:02,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:02,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:02,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:02,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:02,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:02,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:02,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:02,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:03,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:03,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:03,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:03,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:03,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:03,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:03,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 11:04:03,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:03,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:03,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:03,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:03,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:04:03,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335013439] [2021-01-06 11:04:03,205 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:04:03,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251278724] [2021-01-06 11:04:03,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:04:03,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-01-06 11:04:03,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938905605] [2021-01-06 11:04:03,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:04:03,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:03,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:04:03,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:04:03,212 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 13 states. [2021-01-06 11:04:09,999 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-01-06 11:04:10,147 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2021-01-06 11:04:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:10,544 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-01-06 11:04:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 11:04:10,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2021-01-06 11:04:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:10,546 INFO L225 Difference]: With dead ends: 43 [2021-01-06 11:04:10,546 INFO L226 Difference]: Without dead ends: 41 [2021-01-06 11:04:10,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-01-06 11:04:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-01-06 11:04:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2021-01-06 11:04:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 11:04:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-01-06 11:04:10,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2021-01-06 11:04:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:10,572 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-01-06 11:04:10,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:04:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2021-01-06 11:04:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:04:10,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:10,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:10,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:10,775 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1261986696, now seen corresponding path program 1 times [2021-01-06 11:04:10,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:10,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166239585] [2021-01-06 11:04:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:10,796 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:04:10,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046830711] [2021-01-06 11:04:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:04:10,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 29 conjunts are in the unsatisfiable core [2021-01-06 11:04:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:04:10,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 11:04:10,957 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:10,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:10,960 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:04:10,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 11:04:11,020 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:11,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 80 [2021-01-06 11:04:11,025 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:11,045 INFO L625 ElimStorePlain]: treesize reduction 52, result has 20.0 percent of original size [2021-01-06 11:04:11,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:04:11,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:13 [2021-01-06 11:04:11,090 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-01-06 11:04:11,092 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:11,095 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:11,096 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:04:11,096 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:11 [2021-01-06 11:04:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:04:11,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166239585] [2021-01-06 11:04:11,189 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:04:11,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046830711] [2021-01-06 11:04:11,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:04:11,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-01-06 11:04:11,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044029072] [2021-01-06 11:04:11,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:04:11,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:04:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:04:11,193 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 13 states. [2021-01-06 11:04:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:11,749 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-01-06 11:04:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 11:04:11,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2021-01-06 11:04:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:11,751 INFO L225 Difference]: With dead ends: 53 [2021-01-06 11:04:11,751 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 11:04:11,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2021-01-06 11:04:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 11:04:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2021-01-06 11:04:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-01-06 11:04:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-01-06 11:04:11,762 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2021-01-06 11:04:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:11,763 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-01-06 11:04:11,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:04:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2021-01-06 11:04:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:04:11,764 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:11,764 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:11,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:11,978 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash -575224026, now seen corresponding path program 2 times [2021-01-06 11:04:11,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:11,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889152975] [2021-01-06 11:04:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:12,010 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:04:12,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842151588] [2021-01-06 11:04:12,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:12,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 11:04:12,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:04:12,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:04:12,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:04:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:04:12,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889152975] [2021-01-06 11:04:12,172 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:04:12,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842151588] [2021-01-06 11:04:12,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:04:12,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-06 11:04:12,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041785419] [2021-01-06 11:04:12,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:04:12,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:04:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:04:12,174 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2021-01-06 11:04:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:12,334 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2021-01-06 11:04:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:04:12,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2021-01-06 11:04:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:12,335 INFO L225 Difference]: With dead ends: 72 [2021-01-06 11:04:12,335 INFO L226 Difference]: Without dead ends: 44 [2021-01-06 11:04:12,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:04:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-01-06 11:04:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-01-06 11:04:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 11:04:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-01-06 11:04:12,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2021-01-06 11:04:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:12,345 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-01-06 11:04:12,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:04:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2021-01-06 11:04:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:04:12,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:04:12,347 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:04:12,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:12,561 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:04:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:04:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2028432260, now seen corresponding path program 3 times [2021-01-06 11:04:12,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:04:12,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260809416] [2021-01-06 11:04:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:04:12,580 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:04:12,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959927157] [2021-01-06 11:04:12,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:04:12,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 11:04:12,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:04:12,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-06 11:04:12,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:04:12,732 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-01-06 11:04:12,733 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:12,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:12,743 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:04:12,743 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-01-06 11:04:12,803 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:12,803 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 66 [2021-01-06 11:04:12,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:12,836 INFO L625 ElimStorePlain]: treesize reduction 31, result has 51.6 percent of original size [2021-01-06 11:04:12,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:12,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2021-01-06 11:04:13,044 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-01-06 11:04:13,045 INFO L348 Elim1Store]: treesize reduction 14, result has 90.2 percent of original size [2021-01-06 11:04:13,046 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 158 [2021-01-06 11:04:13,052 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:13,102 INFO L625 ElimStorePlain]: treesize reduction 117, result has 23.5 percent of original size [2021-01-06 11:04:13,105 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:13,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:36 [2021-01-06 11:04:13,210 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:04:13,211 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2021-01-06 11:04:13,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:13,246 INFO L625 ElimStorePlain]: treesize reduction 52, result has 38.8 percent of original size [2021-01-06 11:04:13,248 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:13,248 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:33 [2021-01-06 11:04:13,402 INFO L348 Elim1Store]: treesize reduction 14, result has 90.2 percent of original size [2021-01-06 11:04:13,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 158 [2021-01-06 11:04:13,407 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:04:13,490 INFO L625 ElimStorePlain]: treesize reduction 52, result has 65.3 percent of original size [2021-01-06 11:04:13,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,498 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:04:13,498 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:98 [2021-01-06 11:04:13,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:04:13,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:04:13,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:04:13,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 11:04:13,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:04:13,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:13,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:04:13,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:13,963 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2021-01-06 11:04:13,983 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:04:14,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:14,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-06 11:04:14,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:04:14,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:14,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:04:14,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:04:14,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 11:04:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:04:14,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260809416] [2021-01-06 11:04:14,467 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:04:14,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959927157] [2021-01-06 11:04:14,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:04:14,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-01-06 11:04:14,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840135120] [2021-01-06 11:04:14,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 11:04:14,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:04:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 11:04:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-01-06 11:04:14,470 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2021-01-06 11:04:17,719 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-01-06 11:04:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:04:18,340 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2021-01-06 11:04:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 11:04:18,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2021-01-06 11:04:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:04:18,341 INFO L225 Difference]: With dead ends: 50 [2021-01-06 11:04:18,341 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:04:18,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-01-06 11:04:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:04:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:04:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:04:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:04:18,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2021-01-06 11:04:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:04:18,343 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:04:18,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 11:04:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:04:18,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:04:18,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 11:04:18,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:04:18,775 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 88 [2021-01-06 11:04:18,923 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2021-01-06 11:04:19,233 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 30 [2021-01-06 11:04:19,236 INFO L189 CegarLoopUtils]: For program point L23-2(lines 23 24) no Hoare annotation was computed. [2021-01-06 11:04:19,237 INFO L185 CegarLoopUtils]: At program point L23-3(lines 23 24) the Hoare annotation is: (let ((.cse1 (< 1 ULTIMATE.start_main_~S~0)) (.cse2 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse0 (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|)) (.cse4 (= ULTIMATE.start_main_~i~0 0))) (or (and (= (+ (select .cse0 |ULTIMATE.start_main_~#a~0.offset|) 1) 0) .cse1 .cse2 (<= 1 ULTIMATE.start_main_~i~0) .cse3) (and .cse4 .cse1 .cse2 .cse3 (= (+ (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~i~0) (+ (select .cse0 (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 8))) 1))) (and .cse4 (<= ULTIMATE.start_main_~S~0 0)))) [2021-01-06 11:04:19,237 INFO L189 CegarLoopUtils]: For program point L23-4(lines 23 24) no Hoare annotation was computed. [2021-01-06 11:04:19,237 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:04:19,238 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:04:19,238 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:04:19,238 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-01-06 11:04:19,238 INFO L189 CegarLoopUtils]: For program point L20-2(lines 20 21) no Hoare annotation was computed. [2021-01-06 11:04:19,238 INFO L185 CegarLoopUtils]: At program point L20-3(lines 20 21) the Hoare annotation is: (let ((.cse1 (< 1 ULTIMATE.start_main_~S~0)) (.cse2 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse0 (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|)) (.cse4 (= ULTIMATE.start_main_~i~0 0))) (or (and (= (+ (select .cse0 |ULTIMATE.start_main_~#a~0.offset|) 1) 0) .cse1 .cse2 (<= 1 ULTIMATE.start_main_~i~0) .cse3) (and .cse4 .cse1 (exists ((v_prenex_1 Int)) (and (= (+ v_prenex_1 (* v_prenex_1 v_prenex_1)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_prenex_1 8))) 1)) (<= 1 v_prenex_1))) .cse2 (= (select .cse0 (+ |ULTIMATE.start_main_~#a~0.offset| 8)) 0) .cse3 (= (+ (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~i~0) (+ (select .cse0 (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 8))) 1)) (<= ULTIMATE.start_main_~S~0 2)) (and .cse4 (<= ULTIMATE.start_main_~S~0 0)))) [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point L20-4(lines 20 21) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point L8(line 8) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point L8-1(line 8) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point L8-3(line 8) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L192 CegarLoopUtils]: At program point L25(lines 10 26) the Hoare annotation is: true [2021-01-06 11:04:19,239 INFO L189 CegarLoopUtils]: For program point L17-2(lines 17 18) no Hoare annotation was computed. [2021-01-06 11:04:19,239 INFO L185 CegarLoopUtils]: At program point L17-3(lines 17 18) the Hoare annotation is: (let ((.cse0 (< 1 ULTIMATE.start_main_~S~0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse2 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and (= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 1) 0) .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 1) (<= 1 ULTIMATE.start_main_~i~0) .cse2))) [2021-01-06 11:04:19,240 INFO L189 CegarLoopUtils]: For program point L17-4(lines 17 18) no Hoare annotation was computed. [2021-01-06 11:04:19,240 INFO L189 CegarLoopUtils]: For program point L5(lines 5 7) no Hoare annotation was computed. [2021-01-06 11:04:19,240 INFO L189 CegarLoopUtils]: For program point L6(line 6) no Hoare annotation was computed. [2021-01-06 11:04:19,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:04:19 BoogieIcfgContainer [2021-01-06 11:04:19,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:04:19,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:04:19,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:04:19,273 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:04:19,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:04:00" (3/4) ... [2021-01-06 11:04:19,278 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:04:19,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-01-06 11:04:19,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:04:19,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:04:19,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:04:19,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && a == 0) && 1 <= i) && cond == 1) || (((((((i == 0 && 1 < S) && (\exists v_prenex_1 : int :: v_prenex_1 + v_prenex_1 * v_prenex_1 == unknown-#memory_int-unknown[a][a + v_prenex_1 * 8] + 1 && 1 <= v_prenex_1)) && a == 0) && unknown-#memory_int-unknown[a][a + 8] == 0) && cond == 1) && i * i + i == unknown-#memory_int-unknown[a][a + i * 8] + 1) && S <= 2)) || (i == 0 && S <= 0) [2021-01-06 11:04:19,352 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-cav19/array_tiling_poly6.c-witness.graphml [2021-01-06 11:04:19,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:04:19,353 INFO L168 Benchmark]: Toolchain (without parser) took 19925.58 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 134.3 MB in the beginning and 161.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,354 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 159.4 MB. Free memory is still 134.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:04:19,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.29 ms. Allocated memory is still 159.4 MB. Free memory was 134.3 MB in the beginning and 124.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.23 ms. Allocated memory is still 159.4 MB. Free memory was 124.3 MB in the beginning and 123.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,356 INFO L168 Benchmark]: Boogie Preprocessor took 36.89 ms. Allocated memory is still 159.4 MB. Free memory was 123.1 MB in the beginning and 121.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,356 INFO L168 Benchmark]: RCFGBuilder took 605.23 ms. Allocated memory is still 159.4 MB. Free memory was 121.8 MB in the beginning and 107.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,357 INFO L168 Benchmark]: TraceAbstraction took 18857.62 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 107.1 MB in the beginning and 164.2 MB in the end (delta: -57.1 MB). Peak memory consumption was 75.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,357 INFO L168 Benchmark]: Witness Printer took 79.68 ms. Allocated memory is still 191.9 MB. Free memory was 163.7 MB in the beginning and 161.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:04:19,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 159.4 MB. Free memory is still 134.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 285.29 ms. Allocated memory is still 159.4 MB. Free memory was 134.3 MB in the beginning and 124.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.23 ms. Allocated memory is still 159.4 MB. Free memory was 124.3 MB in the beginning and 123.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.89 ms. Allocated memory is still 159.4 MB. Free memory was 123.1 MB in the beginning and 121.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 605.23 ms. Allocated memory is still 159.4 MB. Free memory was 121.8 MB in the beginning and 107.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18857.62 ms. Allocated memory was 159.4 MB in the beginning and 191.9 MB in the end (delta: 32.5 MB). Free memory was 107.1 MB in the beginning and 164.2 MB in the end (delta: -57.1 MB). Peak memory consumption was 75.9 MB. Max. memory is 8.0 GB. * Witness Printer took 79.68 ms. Allocated memory is still 191.9 MB. Free memory was 163.7 MB in the beginning and 161.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2021-01-06 11:04:19,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2021-01-06 11:04:19,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && a == 0) && 1 <= i) && cond == 1) || (((((((i == 0 && 1 < S) && (\exists v_prenex_1 : int :: v_prenex_1 + v_prenex_1 * v_prenex_1 == unknown-#memory_int-unknown[a][a + v_prenex_1 * 8] + 1 && 1 <= v_prenex_1)) && a == 0) && unknown-#memory_int-unknown[a][a + 8] == 0) && cond == 1) && i * i + i == unknown-#memory_int-unknown[a][a + i * 8] + 1) && S <= 2)) || (i == 0 && S <= 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((i == 0 && 1 < S) && a == 0) && cond == 1) || (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && a == 0) && i <= 1) && 1 <= i) && cond == 1) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && a == 0) && 1 <= i) && cond == 1) || ((((i == 0 && 1 < S) && a == 0) && cond == 1) && i * i + i == unknown-#memory_int-unknown[a][a + i * 8] + 1)) || (i == 0 && S <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.0s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 434 SDslu, 190 SDs, 0 SdLazy, 652 SolverSat, 220 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 75 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 27 NumberOfFragments, 194 HoareAnnotationTreeSize, 4 FomulaSimplifications, 15824 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1007 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 124 ConstructedInterpolants, 26 QuantifiedInterpolants, 46590 SizeOfPredicates, 43 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 12/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...