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/rewnifrev2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:19,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:19,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:19,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:19,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:19,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:19,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:19,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:19,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:19,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:19,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:19,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:19,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:19,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:19,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:19,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:19,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:19,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:19,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:19,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:19,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:19,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:19,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:19,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:19,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:19,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:19,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:19,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:19,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:19,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:19,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:19,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:19,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:19,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:19,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:19,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:19,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:19,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:19,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:19,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:19,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:19,255 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-09-20 12:59:19,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:19,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:19,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:19,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:19,278 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:19,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:19,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:19,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:19,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:19,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:19,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:19,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:19,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:19,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:19,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:19,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:19,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:19,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:19,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:19,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:19,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:19,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:19,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:19,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:19,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:19,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:19,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:19,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:19,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:19,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:19,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:19,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:19,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:19,350 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:19,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-09-20 12:59:19,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3036f05/de1e6a7c2ee344d489d714f2d4e92005/FLAGe360390d2 [2019-09-20 12:59:19,841 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:19,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev2.c [2019-09-20 12:59:19,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3036f05/de1e6a7c2ee344d489d714f2d4e92005/FLAGe360390d2 [2019-09-20 12:59:20,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3036f05/de1e6a7c2ee344d489d714f2d4e92005 [2019-09-20 12:59:20,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:20,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:20,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:20,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:20,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:20,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24178ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20, skipping insertion in model container [2019-09-20 12:59:20,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,279 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:20,293 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:20,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:20,487 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:20,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:20,520 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:20,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20 WrapperNode [2019-09-20 12:59:20,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:20,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:20,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:20,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:20,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (1/1) ... [2019-09-20 12:59:20,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:20,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:20,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:20,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:20,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (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-09-20 12:59:20,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:59:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 12:59:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:59:20,919 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:20,919 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 12:59:20,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:20 BoogieIcfgContainer [2019-09-20 12:59:20,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:20,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:20,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:20,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:20,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:20" (1/3) ... [2019-09-20 12:59:20,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e03e6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:20, skipping insertion in model container [2019-09-20 12:59:20,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:20" (2/3) ... [2019-09-20 12:59:20,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e03e6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:20, skipping insertion in model container [2019-09-20 12:59:20,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:20" (3/3) ... [2019-09-20 12:59:20,930 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev2.c [2019-09-20 12:59:20,940 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:20,947 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:20,964 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:21,018 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:21,018 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:21,019 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:21,019 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:21,019 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:21,019 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:21,019 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:21,019 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:21,019 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-20 12:59:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:59:21,039 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:21,040 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:21,041 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -516860939, now seen corresponding path program 1 times [2019-09-20 12:59:21,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:21,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:21,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:21,212 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-20 12:59:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:21,235 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-20 12:59:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:21,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-20 12:59:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:21,246 INFO L225 Difference]: With dead ends: 41 [2019-09-20 12:59:21,247 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 12:59:21,250 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 12:59:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-20 12:59:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-20 12:59:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-20 12:59:21,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-09-20 12:59:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:21,292 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-20 12:59:21,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-20 12:59:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:59:21,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:21,294 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:21,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1546915729, now seen corresponding path program 1 times [2019-09-20 12:59:21,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:21,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:21,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:21,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:21,370 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-09-20 12:59:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:21,419 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-20 12:59:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:21,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-20 12:59:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:21,422 INFO L225 Difference]: With dead ends: 32 [2019-09-20 12:59:21,422 INFO L226 Difference]: Without dead ends: 21 [2019-09-20 12:59:21,424 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-20 12:59:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-20 12:59:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 12:59:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-20 12:59:21,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-09-20 12:59:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:21,434 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-20 12:59:21,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-20 12:59:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:59:21,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:21,436 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:21,436 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash -586037587, now seen corresponding path program 1 times [2019-09-20 12:59:21,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:21,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 12:59:21,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:21,844 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-20 12:59:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:22,030 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-20 12:59:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:22,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-20 12:59:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:22,031 INFO L225 Difference]: With dead ends: 31 [2019-09-20 12:59:22,032 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 12:59:22,034 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 12:59:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-20 12:59:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 12:59:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-20 12:59:22,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2019-09-20 12:59:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:22,053 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-20 12:59:22,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-20 12:59:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:59:22,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,055 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,056 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -798788415, now seen corresponding path program 1 times [2019-09-20 12:59:22,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:22,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:22,308 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-20 12:59:22,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:22,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:22,480 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:22,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:22,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:22,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:22,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:22,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-09-20 12:59:22,858 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-09-20 12:59:22,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2019-09-20 12:59:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:22,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:59:22,888 INFO L567 ElimStorePlain]: treesize reduction 51, result has 22.7 percent of original size [2019-09-20 12:59:22,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:22,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:7 [2019-09-20 12:59:22,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-09-20 12:59:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 12:59:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 12:59:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:59:22,964 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 21 states. [2019-09-20 12:59:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:23,414 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-09-20 12:59:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 12:59:23,415 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-09-20 12:59:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:23,416 INFO L225 Difference]: With dead ends: 39 [2019-09-20 12:59:23,417 INFO L226 Difference]: Without dead ends: 37 [2019-09-20 12:59:23,417 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-09-20 12:59:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-20 12:59:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-20 12:59:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 12:59:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-20 12:59:23,438 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 24 [2019-09-20 12:59:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:23,438 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-20 12:59:23,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 12:59:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-20 12:59:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:23,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:23,442 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:23,442 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash -75510059, now seen corresponding path program 2 times [2019-09-20 12:59:23,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:23,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:23,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:23,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:23,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:23,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:59:23,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:23,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:23,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-20 12:59:23,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:23,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:23,667 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 11 states. [2019-09-20 12:59:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:23,777 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-20 12:59:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:23,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-09-20 12:59:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:23,781 INFO L225 Difference]: With dead ends: 66 [2019-09-20 12:59:23,781 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 12:59:23,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 12:59:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-20 12:59:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 12:59:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-20 12:59:23,790 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-09-20 12:59:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:23,791 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-20 12:59:23,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-20 12:59:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:59:23,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:23,793 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:23,793 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1971334765, now seen corresponding path program 3 times [2019-09-20 12:59:23,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:24,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:24,029 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:24,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:24,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:59:24,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:24,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-20 12:59:24,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:24,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,120 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:24,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:24,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:24,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2019-09-20 12:59:24,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,270 INFO L341 Elim1Store]: treesize reduction 132, result has 51.6 percent of original size [2019-09-20 12:59:24,271 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 4 case distinctions, treesize of input 51 treesize of output 163 [2019-09-20 12:59:24,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,326 INFO L567 ElimStorePlain]: treesize reduction 106, result has 36.5 percent of original size [2019-09-20 12:59:24,327 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-09-20 12:59:24,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:61 [2019-09-20 12:59:25,093 INFO L341 Elim1Store]: treesize reduction 34, result has 79.9 percent of original size [2019-09-20 12:59:25,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 154 [2019-09-20 12:59:25,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:25,149 INFO L567 ElimStorePlain]: treesize reduction 257, result has 7.9 percent of original size [2019-09-20 12:59:25,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:25,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:10 [2019-09-20 12:59:25,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:25,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:25,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-09-20 12:59:25,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-20 12:59:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-20 12:59:25,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-09-20 12:59:25,253 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 28 states. [2019-09-20 12:59:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:27,102 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-09-20 12:59:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-20 12:59:27,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-20 12:59:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:27,104 INFO L225 Difference]: With dead ends: 78 [2019-09-20 12:59:27,104 INFO L226 Difference]: Without dead ends: 50 [2019-09-20 12:59:27,106 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2019-09-20 12:59:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-20 12:59:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-20 12:59:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-20 12:59:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-20 12:59:27,115 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 34 [2019-09-20 12:59:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:27,115 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-20 12:59:27,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-20 12:59:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-20 12:59:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:59:27,117 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:27,117 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:27,117 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash 734357221, now seen corresponding path program 4 times [2019-09-20 12:59:27,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:27,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:27,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:27,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:27,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:27,570 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:27,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:27,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:27,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:27,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:59:27,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:27,636 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:27,636 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:27,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:27,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-09-20 12:59:27,706 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-09-20 12:59:27,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2019-09-20 12:59:27,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:27,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-09-20 12:59:27,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:27,820 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-09-20 12:59:27,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-09-20 12:59:27,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:27,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-09-20 12:59:28,698 INFO L341 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2019-09-20 12:59:28,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 89 [2019-09-20 12:59:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:28,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:28,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:28,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:59:28,731 INFO L567 ElimStorePlain]: treesize reduction 192, result has 7.2 percent of original size [2019-09-20 12:59:28,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:28,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:7 [2019-09-20 12:59:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 12:59:28,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:28,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-09-20 12:59:28,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-20 12:59:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-20 12:59:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 12:59:28,839 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 33 states. [2019-09-20 12:59:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:30,392 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-20 12:59:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-20 12:59:30,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-09-20 12:59:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:30,394 INFO L225 Difference]: With dead ends: 59 [2019-09-20 12:59:30,395 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 12:59:30,397 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=479, Invalid=2383, Unknown=0, NotChecked=0, Total=2862 [2019-09-20 12:59:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 12:59:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-20 12:59:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 12:59:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-20 12:59:30,406 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 44 [2019-09-20 12:59:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:30,406 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-20 12:59:30,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-20 12:59:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-20 12:59:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 12:59:30,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:30,408 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:30,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -261137159, now seen corresponding path program 5 times [2019-09-20 12:59:30,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 12:59:30,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:30,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:59:30,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-20 12:59:30,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:30,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:59:30,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 12:59:30,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:30,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-09-20 12:59:30,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:59:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:59:30,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:59:30,649 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2019-09-20 12:59:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:30,774 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-09-20 12:59:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:59:30,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-20 12:59:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:30,776 INFO L225 Difference]: With dead ends: 102 [2019-09-20 12:59:30,776 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 12:59:30,777 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:59:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 12:59:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-20 12:59:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-20 12:59:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-20 12:59:30,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2019-09-20 12:59:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:30,786 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-20 12:59:30,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 12:59:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-20 12:59:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 12:59:30,788 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:30,788 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:30,788 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1964993353, now seen corresponding path program 6 times [2019-09-20 12:59:30,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 12:59:31,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:31,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:31,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:31,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-20 12:59:31,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:31,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-20 12:59:31,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:31,173 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:31,174 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:31,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-09-20 12:59:31,262 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-09-20 12:59:31,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2019-09-20 12:59:31,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-09-20 12:59:31,374 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-09-20 12:59:31,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-09-20 12:59:31,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-09-20 12:59:31,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:31,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 82 [2019-09-20 12:59:31,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:74 [2019-09-20 12:59:32,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:59:32,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:32,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:32,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 30 [2019-09-20 12:59:32,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:32,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:32,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:32,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:7 [2019-09-20 12:59:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 12:59:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:32,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 36 [2019-09-20 12:59:32,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-20 12:59:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-20 12:59:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2019-09-20 12:59:32,761 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 36 states. [2019-09-20 12:59:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:33,931 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-09-20 12:59:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-20 12:59:33,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2019-09-20 12:59:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:33,933 INFO L225 Difference]: With dead ends: 69 [2019-09-20 12:59:33,934 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 12:59:33,935 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=480, Invalid=2172, Unknown=0, NotChecked=0, Total=2652 [2019-09-20 12:59:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 12:59:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-20 12:59:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 12:59:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-20 12:59:33,948 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 54 [2019-09-20 12:59:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:33,949 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-20 12:59:33,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-20 12:59:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-20 12:59:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 12:59:33,950 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:33,950 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:33,950 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1406101301, now seen corresponding path program 7 times [2019-09-20 12:59:33,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:33,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:33,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 43 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 12:59:34,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:34,037 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:34,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-20 12:59:34,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 12:59:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2019-09-20 12:59:34,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 12:59:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 12:59:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:34,225 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 17 states. [2019-09-20 12:59:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:34,399 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-09-20 12:59:34,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 12:59:34,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-09-20 12:59:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:34,400 INFO L225 Difference]: With dead ends: 120 [2019-09-20 12:59:34,401 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 12:59:34,405 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:59:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 12:59:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-20 12:59:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 12:59:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-20 12:59:34,426 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2019-09-20 12:59:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:34,426 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-20 12:59:34,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 12:59:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-20 12:59:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 12:59:34,431 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,431 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,431 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1367718665, now seen corresponding path program 8 times [2019-09-20 12:59:34,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 12:59:35,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:35,021 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:35,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:35,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:35,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:35,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-20 12:59:35,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:35,100 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:35,101 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:35,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-09-20 12:59:35,207 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-09-20 12:59:35,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2019-09-20 12:59:35,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2019-09-20 12:59:35,326 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-09-20 12:59:35,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-09-20 12:59:35,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:57 [2019-09-20 12:59:35,480 INFO L341 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-09-20 12:59:35,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 82 [2019-09-20 12:59:35,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-09-20 12:59:35,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:35,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 99 [2019-09-20 12:59:35,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:35,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:35,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:88 [2019-09-20 12:59:37,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:59:37,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:37,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:37,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 35 [2019-09-20 12:59:37,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:37,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:37,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:37,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:93, output treesize:7 [2019-09-20 12:59:37,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-20 12:59:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 40 [2019-09-20 12:59:37,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-20 12:59:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-20 12:59:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1269, Unknown=0, NotChecked=0, Total=1560 [2019-09-20 12:59:37,944 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 40 states. [2019-09-20 12:59:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:39,388 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-09-20 12:59:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-20 12:59:39,389 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 64 [2019-09-20 12:59:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:39,391 INFO L225 Difference]: With dead ends: 79 [2019-09-20 12:59:39,391 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 12:59:39,393 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=606, Invalid=2586, Unknown=0, NotChecked=0, Total=3192 [2019-09-20 12:59:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 12:59:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-20 12:59:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 12:59:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-20 12:59:39,406 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 64 [2019-09-20 12:59:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:39,407 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-20 12:59:39,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-20 12:59:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-20 12:59:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 12:59:39,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:39,409 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:39,409 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1539617507, now seen corresponding path program 9 times [2019-09-20 12:59:39,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 63 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:59:39,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:39,503 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:39,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:39,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-20 12:59:39,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:39,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 12:59:39,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:59:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2019-09-20 12:59:39,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 12:59:39,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 12:59:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:59:39,691 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 19 states. [2019-09-20 12:59:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:39,884 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-09-20 12:59:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 12:59:39,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-09-20 12:59:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:39,886 INFO L225 Difference]: With dead ends: 138 [2019-09-20 12:59:39,886 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 12:59:39,887 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2019-09-20 12:59:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 12:59:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-20 12:59:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 12:59:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-09-20 12:59:39,899 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 72 [2019-09-20 12:59:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:39,899 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-09-20 12:59:39,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 12:59:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-09-20 12:59:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 12:59:39,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:39,900 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:39,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash -764331557, now seen corresponding path program 10 times [2019-09-20 12:59:39,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 102 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:59:40,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:40,237 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:40,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:40,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:40,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-20 12:59:40,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:40,314 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 12:59:40,315 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:40,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:40,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2019-09-20 12:59:40,395 INFO L341 Elim1Store]: treesize reduction 152, result has 13.6 percent of original size [2019-09-20 12:59:40,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2019-09-20 12:59:40,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:40,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:40 [2019-09-20 12:59:40,508 INFO L341 Elim1Store]: treesize reduction 282, result has 11.3 percent of original size [2019-09-20 12:59:40,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 65 [2019-09-20 12:59:40,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:40,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2019-09-20 12:59:40,658 INFO L341 Elim1Store]: treesize reduction 430, result has 10.0 percent of original size [2019-09-20 12:59:40,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 82 [2019-09-20 12:59:40,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:40,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:68 [2019-09-20 12:59:40,867 INFO L341 Elim1Store]: treesize reduction 596, result has 9.1 percent of original size [2019-09-20 12:59:40,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 99 [2019-09-20 12:59:40,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:40,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:40,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:82 [2019-09-20 12:59:40,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:41,136 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 36 [2019-09-20 12:59:41,137 INFO L341 Elim1Store]: treesize reduction 780, result has 8.5 percent of original size [2019-09-20 12:59:41,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 116 [2019-09-20 12:59:41,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:41,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:41,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:41,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:99 [2019-09-20 12:59:43,408 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2019-09-20 12:59:43,409 INFO L341 Elim1Store]: treesize reduction 372, result has 24.2 percent of original size [2019-09-20 12:59:43,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 155 [2019-09-20 12:59:43,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:59:43,472 INFO L567 ElimStorePlain]: treesize reduction 560, result has 2.6 percent of original size [2019-09-20 12:59:43,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:43,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2019-09-20 12:59:43,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 31 proven. 104 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-20 12:59:43,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:43,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28] total 43 [2019-09-20 12:59:43,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-20 12:59:43,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-20 12:59:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1492, Unknown=0, NotChecked=0, Total=1806 [2019-09-20 12:59:43,673 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 43 states. [2019-09-20 12:59:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,006 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-09-20 12:59:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-20 12:59:46,007 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 74 [2019-09-20 12:59:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,008 INFO L225 Difference]: With dead ends: 89 [2019-09-20 12:59:46,009 INFO L226 Difference]: Without dead ends: 87 [2019-09-20 12:59:46,011 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 19 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=680, Invalid=3102, Unknown=0, NotChecked=0, Total=3782 [2019-09-20 12:59:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-20 12:59:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-20 12:59:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-20 12:59:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-09-20 12:59:46,027 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 74 [2019-09-20 12:59:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,027 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-09-20 12:59:46,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-20 12:59:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-09-20 12:59:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 12:59:46,028 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,028 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,029 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1491851759, now seen corresponding path program 11 times [2019-09-20 12:59:46,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 87 proven. 61 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:59:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:46,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:59:46,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-20 12:59:46,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:46,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 12:59:46,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:59:46,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:46,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2019-09-20 12:59:46,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 12:59:46,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 12:59:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:59:46,373 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 21 states. [2019-09-20 12:59:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,618 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-09-20 12:59:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 12:59:46,618 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-09-20 12:59:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,619 INFO L225 Difference]: With dead ends: 156 [2019-09-20 12:59:46,619 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 12:59:46,624 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=290, Unknown=0, NotChecked=0, Total=462 [2019-09-20 12:59:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 12:59:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-20 12:59:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-20 12:59:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-20 12:59:46,644 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2019-09-20 12:59:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,645 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-20 12:59:46,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 12:59:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-20 12:59:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 12:59:46,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,646 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,646 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1600614701, now seen corresponding path program 12 times [2019-09-20 12:59:46,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 21 proven. 140 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:59:47,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:47,083 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:47,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:47,192 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-20 12:59:47,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:47,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 12:59:47,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:47,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 12:59:47,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:47,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:47,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:47,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:34 [2019-09-20 12:59:47,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:47,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2019-09-20 12:59:47,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:47,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:47,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:47,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:48 [2019-09-20 12:59:47,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,574 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-20 12:59:47,575 INFO L341 Elim1Store]: treesize reduction 38, result has 87.8 percent of original size [2019-09-20 12:59:47,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 311 [2019-09-20 12:59:47,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:47,655 INFO L567 ElimStorePlain]: treesize reduction 237, result has 24.8 percent of original size [2019-09-20 12:59:47,656 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-09-20 12:59:47,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:78 [2019-09-20 12:59:47,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:47,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,048 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-09-20 12:59:48,049 INFO L341 Elim1Store]: treesize reduction 38, result has 90.9 percent of original size [2019-09-20 12:59:48,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 93 treesize of output 439 [2019-09-20 12:59:48,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:48,155 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-09-20 12:59:48,155 INFO L567 ElimStorePlain]: treesize reduction 384, result has 19.3 percent of original size [2019-09-20 12:59:48,156 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-09-20 12:59:48,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:92 [2019-09-20 12:59:48,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,618 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-09-20 12:59:48,619 INFO L341 Elim1Store]: treesize reduction 38, result has 91.9 percent of original size [2019-09-20 12:59:48,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 107 treesize of output 509 [2019-09-20 12:59:48,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:48,748 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-09-20 12:59:48,749 INFO L567 ElimStorePlain]: treesize reduction 447, result has 19.2 percent of original size [2019-09-20 12:59:48,750 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-09-20 12:59:48,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:120, output treesize:106 [2019-09-20 12:59:48,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:48,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,273 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 105 [2019-09-20 12:59:49,274 INFO L341 Elim1Store]: treesize reduction 38, result has 92.7 percent of original size [2019-09-20 12:59:49,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 121 treesize of output 579 [2019-09-20 12:59:49,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:49,420 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 52 [2019-09-20 12:59:49,421 INFO L567 ElimStorePlain]: treesize reduction 552, result has 17.9 percent of original size [2019-09-20 12:59:49,421 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-09-20 12:59:49,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:134, output treesize:120 [2019-09-20 12:59:49,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:49,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:50,079 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2019-09-20 12:59:50,079 INFO L341 Elim1Store]: treesize reduction 38, result has 93.4 percent of original size [2019-09-20 12:59:50,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 135 treesize of output 649 [2019-09-20 12:59:50,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:50,247 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 59 [2019-09-20 12:59:50,248 INFO L567 ElimStorePlain]: treesize reduction 594, result has 18.7 percent of original size [2019-09-20 12:59:50,249 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-09-20 12:59:50,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:151, output treesize:137 [2019-09-20 12:59:53,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:59:53,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:53,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:53,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 45 [2019-09-20 12:59:53,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:53,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:53,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:53,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:126, output treesize:10 [2019-09-20 12:59:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 3 proven. 176 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-20 12:59:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 32] total 48 [2019-09-20 12:59:53,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-20 12:59:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-20 12:59:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2002, Unknown=0, NotChecked=0, Total=2256 [2019-09-20 12:59:53,649 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 48 states. [2019-09-20 12:59:55,241 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-09-20 12:59:57,184 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-20 13:00:01,309 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-20 13:00:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,317 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-09-20 13:00:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-20 13:00:01,318 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 84 [2019-09-20 13:00:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,320 INFO L225 Difference]: With dead ends: 171 [2019-09-20 13:00:01,320 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:00:01,326 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 43 SyntacticMatches, 23 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3325 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1016, Invalid=8686, Unknown=0, NotChecked=0, Total=9702 [2019-09-20 13:00:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:00:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-09-20 13:00:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:00:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-20 13:00:01,346 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 84 [2019-09-20 13:00:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,346 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-20 13:00:01,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-20 13:00:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-20 13:00:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:00:01,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,347 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:01,348 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash 523550975, now seen corresponding path program 13 times [2019-09-20 13:00:01,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:00:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 24 proven. 184 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-20 13:00:01,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:01,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:01,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 13:00:01,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:02,003 INFO L341 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2019-09-20 13:00:02,003 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 1 case distinctions, treesize of input 25 treesize of output 26 [2019-09-20 13:00:02,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:02,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:02,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:02,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26