java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/nr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:49:45,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:49:45,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:49:46,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:49:46,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:49:46,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:49:46,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:49:46,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:49:46,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:49:46,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:49:46,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:49:46,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:49:46,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:49:46,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:49:46,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:49:46,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:49:46,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:49:46,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:49:46,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:49:46,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:49:46,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:49:46,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:49:46,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:49:46,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:49:46,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:49:46,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:49:46,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:49:46,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:49:46,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:49:46,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:49:46,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:49:46,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:49:46,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:49:46,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:49:46,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:49:46,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:49:46,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:49:46,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:49:46,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:49:46,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:49:46,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:49:46,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:49:46,056 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:49:46,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:49:46,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:49:46,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:49:46,058 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:49:46,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:49:46,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:49:46,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:49:46,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:49:46,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:49:46,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:49:46,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:49:46,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:49:46,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:49:46,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:49:46,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:49:46,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:49:46,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:49:46,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:49:46,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:49:46,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:49:46,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:46,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:49:46,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:49:46,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:49:46,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:49:46,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:49:46,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:49:46,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:49:46,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:49:46,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:49:46,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:49:46,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:49:46,394 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:49:46,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr5.c [2019-10-14 21:49:46,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7b35d00/aa534c255bdc4c93ae5397be4d17d77f/FLAG2f6176267 [2019-10-14 21:49:46,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:49:46,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr5.c [2019-10-14 21:49:46,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7b35d00/aa534c255bdc4c93ae5397be4d17d77f/FLAG2f6176267 [2019-10-14 21:49:47,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7b35d00/aa534c255bdc4c93ae5397be4d17d77f [2019-10-14 21:49:47,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:49:47,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:49:47,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:47,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:49:47,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:49:47,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfc0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47, skipping insertion in model container [2019-10-14 21:49:47,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:49:47,358 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:49:47,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:47,537 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:49:47,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:47,578 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:49:47,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47 WrapperNode [2019-10-14 21:49:47,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:47,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:49:47,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:49:47,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:49:47,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:49:47,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:49:47,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:49:47,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:49:47,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:49:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:49:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:49:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:49:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:49:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:49:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:49:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:49:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:49:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:49:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:49:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:49:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:49:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:49:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:49:48,097 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:49:48,097 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:49:48,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:48 BoogieIcfgContainer [2019-10-14 21:49:48,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:49:48,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:49:48,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:49:48,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:49:48,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:49:47" (1/3) ... [2019-10-14 21:49:48,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643db9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:48, skipping insertion in model container [2019-10-14 21:49:48,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (2/3) ... [2019-10-14 21:49:48,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643db9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:48, skipping insertion in model container [2019-10-14 21:49:48,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:48" (3/3) ... [2019-10-14 21:49:48,123 INFO L109 eAbstractionObserver]: Analyzing ICFG nr5.c [2019-10-14 21:49:48,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:49:48,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:49:48,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:49:48,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:49:48,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:49:48,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:49:48,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:49:48,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:49:48,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:49:48,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:49:48,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:49:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:49:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:48,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:48,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:48,227 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 21:49:48,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:48,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11888437] [2019-10-14 21:49:48,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:48,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11888437] [2019-10-14 21:49:48,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:48,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:49:48,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875732804] [2019-10-14 21:49:48,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:48,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:48,618 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-14 21:49:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:48,842 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 21:49:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:48,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:49:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:48,854 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:49:48,855 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:49:48,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:49:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:49:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:49:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:49:48,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 21:49:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:48,903 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:49:48,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:49:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:48,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:48,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:48,905 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 21:49:48,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:48,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223307856] [2019-10-14 21:49:48,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223307856] [2019-10-14 21:49:49,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:49,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41658281] [2019-10-14 21:49:49,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,127 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-14 21:49:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,273 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 21:49:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:49,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:49:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,277 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:49:49,278 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:49:49,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:49:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 21:49:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:49:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 21:49:49,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 21:49:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,297 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 21:49:49,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 21:49:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 21:49:49,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 21:49:49,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497120768] [2019-10-14 21:49:49,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497120768] [2019-10-14 21:49:49,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:49:49,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903963453] [2019-10-14 21:49:49,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:49:49,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:49:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:49,415 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-14 21:49:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,490 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 21:49:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:49:49,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 21:49:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,491 INFO L225 Difference]: With dead ends: 56 [2019-10-14 21:49:49,492 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:49,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 21:49:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 21:49:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 21:49:49,500 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 21:49:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,500 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 21:49:49,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:49:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 21:49:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:49,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 21:49:49,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063957786] [2019-10-14 21:49:49,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063957786] [2019-10-14 21:49:49,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:49,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046055018] [2019-10-14 21:49:49,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,563 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-14 21:49:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,657 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 21:49:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:49,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,659 INFO L225 Difference]: With dead ends: 57 [2019-10-14 21:49:49,659 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:49,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 21:49:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:49:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 21:49:49,672 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 21:49:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,673 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 21:49:49,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 21:49:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:49,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,676 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 21:49:49,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554607178] [2019-10-14 21:49:49,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554607178] [2019-10-14 21:49:49,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580390441] [2019-10-14 21:49:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:49:49,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,840 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:49,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 21:49:49,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957695392] [2019-10-14 21:49:49,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,841 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-14 21:49:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,937 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-10-14 21:49:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:49,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,938 INFO L225 Difference]: With dead ends: 61 [2019-10-14 21:49:49,938 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:49:49,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:49:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-14 21:49:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:49:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 21:49:49,946 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-10-14 21:49:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,947 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 21:49:49,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 21:49:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:49,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,948 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:50,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,153 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:50,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-10-14 21:49:50,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:50,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693269106] [2019-10-14 21:49:50,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693269106] [2019-10-14 21:49:50,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127649808] [2019-10-14 21:49:50,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:50,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,373 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:50,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-14 21:49:50,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110088702] [2019-10-14 21:49:50,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:49:50,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:49:50,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:50,384 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-10-14 21:49:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:50,494 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-10-14 21:49:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:50,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-14 21:49:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:50,495 INFO L225 Difference]: With dead ends: 63 [2019-10-14 21:49:50,495 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:49:50,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:49:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-14 21:49:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 21:49:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-14 21:49:50,503 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-10-14 21:49:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:50,503 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-14 21:49:50,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:49:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-14 21:49:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:50,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:50,504 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:50,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,707 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-10-14 21:49:50,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:50,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969940039] [2019-10-14 21:49:50,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969940039] [2019-10-14 21:49:50,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859887019] [2019-10-14 21:49:50,774 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:50,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:50,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:50,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:50,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,838 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:50,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-14 21:49:50,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433351] [2019-10-14 21:49:50,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:50,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:50,841 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-14 21:49:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:50,943 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-10-14 21:49:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:50,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-14 21:49:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:50,945 INFO L225 Difference]: With dead ends: 67 [2019-10-14 21:49:50,945 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 21:49:50,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 21:49:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-14 21:49:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 21:49:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 21:49:50,959 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-10-14 21:49:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:50,959 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 21:49:50,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 21:49:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:49:50,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:50,962 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:51,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-10-14 21:49:51,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:51,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433536533] [2019-10-14 21:49:51,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433536533] [2019-10-14 21:49:51,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549772104] [2019-10-14 21:49:51,265 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:51,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:51,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:51,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 21:49:51,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:51,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-10-14 21:49:51,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600425066] [2019-10-14 21:49:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 21:49:51,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 21:49:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:49:51,364 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2019-10-14 21:49:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,468 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-10-14 21:49:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:51,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-14 21:49:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,469 INFO L225 Difference]: With dead ends: 69 [2019-10-14 21:49:51,469 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 21:49:51,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:49:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 21:49:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-14 21:49:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 21:49:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-14 21:49:51,484 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-10-14 21:49:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,486 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-14 21:49:51,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 21:49:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-14 21:49:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:49:51,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,488 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:51,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 3 times [2019-10-14 21:49:51,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:51,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158497108] [2019-10-14 21:49:51,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158497108] [2019-10-14 21:49:51,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767837551] [2019-10-14 21:49:51,769 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 21:49:51,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:49:51,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:51,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:51,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 21:49:51,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:51,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-10-14 21:49:51,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850149447] [2019-10-14 21:49:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:49:51,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:49:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:51,853 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2019-10-14 21:49:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,983 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-10-14 21:49:51,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 21:49:51,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-10-14 21:49:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,985 INFO L225 Difference]: With dead ends: 74 [2019-10-14 21:49:51,985 INFO L226 Difference]: Without dead ends: 44 [2019-10-14 21:49:51,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:49:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-14 21:49:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-14 21:49:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 21:49:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-10-14 21:49:51,993 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2019-10-14 21:49:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,993 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-10-14 21:49:51,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:49:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-10-14 21:49:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:49:51,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,994 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:52,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1980068480, now seen corresponding path program 3 times [2019-10-14 21:49:52,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:52,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435143372] [2019-10-14 21:49:52,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:52,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435143372] [2019-10-14 21:49:52,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348595855] [2019-10-14 21:49:52,315 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-14 21:49:52,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:52,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:49:52,386 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:52,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-10-14 21:49:52,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369133618] [2019-10-14 21:49:52,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:49:52,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:49:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:49:52,388 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 11 states. [2019-10-14 21:49:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:52,607 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-10-14 21:49:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:49:52,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-10-14 21:49:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:52,609 INFO L225 Difference]: With dead ends: 81 [2019-10-14 21:49:52,609 INFO L226 Difference]: Without dead ends: 44 [2019-10-14 21:49:52,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:49:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-14 21:49:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-14 21:49:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 21:49:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-14 21:49:52,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 34 [2019-10-14 21:49:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:52,618 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-14 21:49:52,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:49:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-14 21:49:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:49:52,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:52,619 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:52,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,831 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -700204802, now seen corresponding path program 4 times [2019-10-14 21:49:52,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:52,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619877889] [2019-10-14 21:49:52,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:53,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619877889] [2019-10-14 21:49:53,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466480232] [2019-10-14 21:49:53,590 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:53,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:49:53,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:53,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:49:53,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:53,722 INFO L375 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 18 treesize of output 14 [2019-10-14 21:49:53,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:49:53,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,821 INFO L375 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 [2019-10-14 21:49:53,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-14 21:49:53,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2019-10-14 21:49:53,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,979 INFO L496 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. [2019-10-14 21:49:53,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-10-14 21:49:54,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:54,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2019-10-14 21:49:54,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:54,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:54,153 INFO L496 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. [2019-10-14 21:49:54,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:77 [2019-10-14 21:49:54,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:54,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:54,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 68 [2019-10-14 21:49:54,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:54,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:54,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:54,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:84, output treesize:80 [2019-10-14 21:49:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:54,533 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:54,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2019-10-14 21:49:54,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020636225] [2019-10-14 21:49:54,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 21:49:54,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 21:49:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:49:54,535 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 30 states. [2019-10-14 21:49:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:57,015 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2019-10-14 21:49:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-14 21:49:57,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-10-14 21:49:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:57,018 INFO L225 Difference]: With dead ends: 128 [2019-10-14 21:49:57,018 INFO L226 Difference]: Without dead ends: 112 [2019-10-14 21:49:57,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-10-14 21:49:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-14 21:49:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 46. [2019-10-14 21:49:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 21:49:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-10-14 21:49:57,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2019-10-14 21:49:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:57,038 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-10-14 21:49:57,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-14 21:49:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-10-14 21:49:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 21:49:57,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:57,041 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:57,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:57,242 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash -490976331, now seen corresponding path program 1 times [2019-10-14 21:49:57,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:57,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072139490] [2019-10-14 21:49:57,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:57,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:57,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:57,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072139490] [2019-10-14 21:49:57,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395890000] [2019-10-14 21:49:57,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:57,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:49:57,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:57,804 INFO L375 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 18 treesize of output 14 [2019-10-14 21:49:57,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:57,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:57,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:57,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:49:57,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:57,893 INFO L375 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 [2019-10-14 21:49:57,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:57,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:57,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:57,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-14 21:49:57,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:58,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2019-10-14 21:49:58,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:58,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:58,022 INFO L496 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. [2019-10-14 21:49:58,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:58 [2019-10-14 21:49:58,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:58,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:58,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 169 [2019-10-14 21:49:58,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:58,205 INFO L567 ElimStorePlain]: treesize reduction 75, result has 56.9 percent of original size [2019-10-14 21:49:58,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:58,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:99 [2019-10-14 21:49:58,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:00,043 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-14 21:50:02,097 WARN L191 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 89 [2019-10-14 21:50:02,574 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 21:50:02,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 21:50:05,276 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2019-10-14 21:50:05,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:05,377 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:05,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-10-14 21:50:05,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563157780] [2019-10-14 21:50:05,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-14 21:50:05,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-14 21:50:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 21:50:05,379 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 33 states. [2019-10-14 21:50:07,285 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-10-14 21:50:08,982 WARN L191 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-14 21:50:10,735 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-14 21:50:11,121 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-14 21:50:14,100 WARN L191 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-10-14 21:50:17,239 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 155 DAG size of output: 98 [2019-10-14 21:50:17,906 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-14 21:50:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:18,001 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-10-14 21:50:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:50:18,001 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-10-14 21:50:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:18,002 INFO L225 Difference]: With dead ends: 114 [2019-10-14 21:50:18,002 INFO L226 Difference]: Without dead ends: 98 [2019-10-14 21:50:18,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 21:50:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-14 21:50:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2019-10-14 21:50:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 21:50:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-10-14 21:50:18,019 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 43 [2019-10-14 21:50:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:18,020 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-10-14 21:50:18,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-14 21:50:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-10-14 21:50:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 21:50:18,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:18,022 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:18,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:18,226 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -532162850, now seen corresponding path program 2 times [2019-10-14 21:50:18,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:18,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428957807] [2019-10-14 21:50:18,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:18,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:18,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428957807] [2019-10-14 21:50:18,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261725376] [2019-10-14 21:50:18,589 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:18,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:18,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:18,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-14 21:50:18,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:18,840 INFO L375 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 18 treesize of output 14 [2019-10-14 21:50:18,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:18,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:18,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:18,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:50:18,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:18,934 INFO L375 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 [2019-10-14 21:50:18,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:18,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:18,948 INFO L496 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. [2019-10-14 21:50:18,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-10-14 21:50:19,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:19,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:19,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 113 [2019-10-14 21:50:19,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:19,077 INFO L567 ElimStorePlain]: treesize reduction 48, result has 58.6 percent of original size [2019-10-14 21:50:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,080 INFO L496 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. [2019-10-14 21:50:19,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:68 [2019-10-14 21:50:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:21,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:21,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:21,420 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-14 21:50:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:21,529 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:21,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2019-10-14 21:50:21,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543483430] [2019-10-14 21:50:21,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-14 21:50:21,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:21,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-14 21:50:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 21:50:21,532 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 38 states. [2019-10-14 21:50:22,166 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-10-14 21:50:25,304 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-14 21:50:25,470 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-14 21:50:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:26,152 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2019-10-14 21:50:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 21:50:26,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-10-14 21:50:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:26,155 INFO L225 Difference]: With dead ends: 110 [2019-10-14 21:50:26,155 INFO L226 Difference]: Without dead ends: 108 [2019-10-14 21:50:26,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=417, Invalid=2889, Unknown=0, NotChecked=0, Total=3306 [2019-10-14 21:50:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-14 21:50:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-10-14 21:50:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-14 21:50:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-10-14 21:50:26,173 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 52 [2019-10-14 21:50:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:26,174 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-10-14 21:50:26,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-14 21:50:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-10-14 21:50:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-14 21:50:26,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:26,175 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:26,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:26,379 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash -280245803, now seen corresponding path program 3 times [2019-10-14 21:50:26,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:26,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854013746] [2019-10-14 21:50:26,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:26,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854013746] [2019-10-14 21:50:26,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868673414] [2019-10-14 21:50:26,657 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:26,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-14 21:50:26,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:26,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:50:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:26,779 INFO L375 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 18 treesize of output 14 [2019-10-14 21:50:26,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-14 21:50:26,893 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-14 21:50:26,894 INFO L375 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 30 [2019-10-14 21:50:26,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-10-14 21:50:29,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 31 refuted. 4 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-14 21:50:29,277 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:29,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2019-10-14 21:50:29,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094366298] [2019-10-14 21:50:29,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-14 21:50:29,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-14 21:50:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=843, Unknown=1, NotChecked=0, Total=992 [2019-10-14 21:50:29,279 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 32 states.