./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9722a10940ebd7a5d75170225a40cd37454d0528 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:36:39,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:36:39,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:36:39,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:36:39,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:36:39,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:36:39,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:36:39,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:36:39,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:36:39,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:36:39,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:36:39,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:36:39,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:36:39,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:36:39,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:36:39,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:36:39,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:36:39,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:36:39,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:36:39,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:36:39,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:36:39,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:36:39,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:36:39,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:36:39,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:36:39,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:36:39,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:36:39,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:36:39,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:36:39,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:36:39,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:36:39,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:36:39,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:36:39,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:36:39,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:36:39,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:36:39,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:36:39,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:36:39,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:36:39,444 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:36:39,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:36:39,444 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:36:39,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:36:39,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:36:39,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:36:39,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:36:39,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:36:39,446 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:36:39,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:36:39,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:36:39,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:36:39,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:36:39,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:36:39,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:36:39,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:36:39,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:36:39,448 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:36:39,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:36:39,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:36:39,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:36:39,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-12-31 05:36:39,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:36:39,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:36:39,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:36:39,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:36:39,503 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:36:39,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-31 05:36:39,571 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69d112b0/5a39d7d1a7d84c43b5d9b9699faacabc/FLAGa231ee6e3 [2018-12-31 05:36:40,070 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:36:40,071 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-31 05:36:40,078 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69d112b0/5a39d7d1a7d84c43b5d9b9699faacabc/FLAGa231ee6e3 [2018-12-31 05:36:40,418 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69d112b0/5a39d7d1a7d84c43b5d9b9699faacabc [2018-12-31 05:36:40,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:36:40,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:36:40,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:36:40,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:36:40,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:36:40,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c62f4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40, skipping insertion in model container [2018-12-31 05:36:40,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:36:40,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:36:40,689 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:36:40,695 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:36:40,737 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:36:40,773 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:36:40,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40 WrapperNode [2018-12-31 05:36:40,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:36:40,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:36:40,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:36:40,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:36:40,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:36:40,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:36:40,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:36:40,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:36:40,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (1/1) ... [2018-12-31 05:36:40,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:36:40,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:36:40,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:36:40,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:36:40,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (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 [2018-12-31 05:36:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:36:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:36:41,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:36:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:36:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:36:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:36:41,557 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:36:41,558 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-31 05:36:41,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:41 BoogieIcfgContainer [2018-12-31 05:36:41,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:36:41,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:36:41,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:36:41,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:36:41,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:36:40" (1/3) ... [2018-12-31 05:36:41,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d7cc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:36:41, skipping insertion in model container [2018-12-31 05:36:41,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:36:40" (2/3) ... [2018-12-31 05:36:41,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d7cc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:36:41, skipping insertion in model container [2018-12-31 05:36:41,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:41" (3/3) ... [2018-12-31 05:36:41,567 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-12-31 05:36:41,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:36:41,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:36:41,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:36:41,643 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:36:41,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:36:41,644 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:36:41,644 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:36:41,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:36:41,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:36:41,645 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:36:41,645 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:36:41,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:36:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-31 05:36:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 05:36:41,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:41,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:41,672 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1808788559, now seen corresponding path program 1 times [2018-12-31 05:36:41,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:41,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:36:42,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 05:36:42,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:36:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:36:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:36:42,096 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-12-31 05:36:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:42,317 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-31 05:36:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:36:42,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-31 05:36:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:42,330 INFO L225 Difference]: With dead ends: 54 [2018-12-31 05:36:42,331 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 05:36:42,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:36:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 05:36:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-31 05:36:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 05:36:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-12-31 05:36:42,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2018-12-31 05:36:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:42,370 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-31 05:36:42,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:36:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-12-31 05:36:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:36:42,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:42,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:42,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 616714882, now seen corresponding path program 1 times [2018-12-31 05:36:42,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:42,969 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2018-12-31 05:36:43,199 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-12-31 05:36:43,420 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2018-12-31 05:36:43,752 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-12-31 05:36:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:44,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:44,003 INFO L223 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 [2018-12-31 05:36:44,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:44,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:44,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:36:44,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:44,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:36:44,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:44,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:44,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-31 05:36:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:44,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-12-31 05:36:44,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 05:36:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 05:36:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-31 05:36:44,504 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2018-12-31 05:36:45,266 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-31 05:36:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:45,563 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-12-31 05:36:45,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 05:36:45,564 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-12-31 05:36:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:45,565 INFO L225 Difference]: With dead ends: 71 [2018-12-31 05:36:45,565 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 05:36:45,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:36:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 05:36:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2018-12-31 05:36:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 05:36:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-12-31 05:36:45,575 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2018-12-31 05:36:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:45,576 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-31 05:36:45,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 05:36:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-12-31 05:36:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:36:45,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:45,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:45,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1296773252, now seen corresponding path program 1 times [2018-12-31 05:36:45,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:45,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:45,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:45,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:45,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:45,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:36:45,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 05:36:45,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:36:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:36:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:36:45,642 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-12-31 05:36:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:45,757 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-12-31 05:36:45,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:36:45,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-31 05:36:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:45,762 INFO L225 Difference]: With dead ends: 83 [2018-12-31 05:36:45,762 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 05:36:45,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:36:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 05:36:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2018-12-31 05:36:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 05:36:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-31 05:36:45,774 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2018-12-31 05:36:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:45,774 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-31 05:36:45,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:36:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-12-31 05:36:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 05:36:45,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:45,776 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:45,776 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2022971496, now seen corresponding path program 1 times [2018-12-31 05:36:45,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:45,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:45,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:45,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:45,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:46,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:46,088 INFO L223 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 [2018-12-31 05:36:46,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:46,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:46,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:46,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-12-31 05:36:46,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 05:36:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 05:36:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:36:46,229 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 9 states. [2018-12-31 05:36:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:46,598 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-12-31 05:36:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:36:46,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-31 05:36:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:46,599 INFO L225 Difference]: With dead ends: 60 [2018-12-31 05:36:46,600 INFO L226 Difference]: Without dead ends: 48 [2018-12-31 05:36:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:36:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-31 05:36:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-12-31 05:36:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 05:36:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-12-31 05:36:46,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2018-12-31 05:36:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:46,607 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-12-31 05:36:46,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 05:36:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-12-31 05:36:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:36:46,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:46,609 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:46,609 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 958971857, now seen corresponding path program 1 times [2018-12-31 05:36:46,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:47,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:47,409 INFO L223 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 [2018-12-31 05:36:47,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:47,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:47,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:36:47,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:47,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:36:47,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:47,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:47,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:47,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-31 05:36:48,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:48,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-12-31 05:36:48,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:48,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:36:48,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-31 05:36:48,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:48,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:48,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:48,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-12-31 05:36:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:48,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-12-31 05:36:48,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 05:36:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 05:36:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-12-31 05:36:48,602 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 25 states. [2018-12-31 05:36:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:49,301 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-12-31 05:36:49,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 05:36:49,303 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2018-12-31 05:36:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:49,304 INFO L225 Difference]: With dead ends: 77 [2018-12-31 05:36:49,304 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 05:36:49,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 05:36:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 05:36:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-12-31 05:36:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 05:36:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-12-31 05:36:49,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-12-31 05:36:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:49,311 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-12-31 05:36:49,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 05:36:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-12-31 05:36:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 05:36:49,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:49,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:49,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 632161909, now seen corresponding path program 2 times [2018-12-31 05:36:49,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:49,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:49,616 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2018-12-31 05:36:50,267 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-12-31 05:36:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:50,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:50,559 INFO L223 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 [2018-12-31 05:36:50,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:36:50,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:36:50,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:50,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:50,978 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 05:36:51,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:36:51,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:51,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:36:51,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:51,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-12-31 05:36:51,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:36:51,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:51,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:51,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:51,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:36:51,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:51,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:36:51,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-31 05:36:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:51,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:51,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-12-31 05:36:51,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 05:36:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 05:36:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-12-31 05:36:51,421 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 18 states. [2018-12-31 05:36:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:52,212 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2018-12-31 05:36:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 05:36:52,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-31 05:36:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:52,216 INFO L225 Difference]: With dead ends: 111 [2018-12-31 05:36:52,216 INFO L226 Difference]: Without dead ends: 94 [2018-12-31 05:36:52,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-12-31 05:36:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-31 05:36:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2018-12-31 05:36:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 05:36:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-12-31 05:36:52,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 19 [2018-12-31 05:36:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:52,236 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-12-31 05:36:52,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 05:36:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-12-31 05:36:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 05:36:52,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:52,237 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:52,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash 44460555, now seen corresponding path program 2 times [2018-12-31 05:36:52,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:52,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:52,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:36:52,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:52,814 INFO L223 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 [2018-12-31 05:36:52,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:36:52,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:36:52,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:52,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:53,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-31 05:36:53,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:53,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-31 05:36:53,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:53,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:53,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:53,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-31 05:36:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:53,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:53,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-12-31 05:36:53,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-31 05:36:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-31 05:36:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:36:53,360 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 24 states. [2018-12-31 05:36:53,975 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 05:36:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:54,251 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-31 05:36:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 05:36:54,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-31 05:36:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:54,255 INFO L225 Difference]: With dead ends: 118 [2018-12-31 05:36:54,256 INFO L226 Difference]: Without dead ends: 101 [2018-12-31 05:36:54,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 05:36:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-31 05:36:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-12-31 05:36:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 05:36:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-31 05:36:54,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 23 [2018-12-31 05:36:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:54,271 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-31 05:36:54,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-31 05:36:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-31 05:36:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 05:36:54,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:54,274 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:54,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -55202372, now seen corresponding path program 1 times [2018-12-31 05:36:54,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:54,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:54,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:36:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:55,035 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-31 05:36:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:55,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:55,550 INFO L223 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 [2018-12-31 05:36:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:55,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:55,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-31 05:36:55,866 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-12-31 05:36:55,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:55,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 05:36:55,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:55,879 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-31 05:36:55,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:55,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:55,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:55,893 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:17 [2018-12-31 05:36:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:55,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:55,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2018-12-31 05:36:55,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 05:36:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 05:36:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-31 05:36:55,947 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 18 states. [2018-12-31 05:36:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:57,990 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2018-12-31 05:36:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-31 05:36:57,991 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-12-31 05:36:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:57,992 INFO L225 Difference]: With dead ends: 229 [2018-12-31 05:36:57,993 INFO L226 Difference]: Without dead ends: 212 [2018-12-31 05:36:57,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=630, Invalid=2676, Unknown=0, NotChecked=0, Total=3306 [2018-12-31 05:36:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-31 05:36:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 101. [2018-12-31 05:36:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-31 05:36:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2018-12-31 05:36:58,017 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 24 [2018-12-31 05:36:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:58,017 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2018-12-31 05:36:58,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 05:36:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2018-12-31 05:36:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 05:36:58,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:58,020 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:58,020 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 624855998, now seen corresponding path program 2 times [2018-12-31 05:36:58,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:58,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:36:58,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:58,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:58,113 INFO L223 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:36:58,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:36:58,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:36:58,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:58,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:58,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:36:58,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 05:36:58,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:36:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:36:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:36:58,200 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 7 states. [2018-12-31 05:36:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:36:58,391 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2018-12-31 05:36:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 05:36:58,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-31 05:36:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:36:58,393 INFO L225 Difference]: With dead ends: 201 [2018-12-31 05:36:58,394 INFO L226 Difference]: Without dead ends: 140 [2018-12-31 05:36:58,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:36:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-31 05:36:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2018-12-31 05:36:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-31 05:36:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-12-31 05:36:58,433 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 24 [2018-12-31 05:36:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:36:58,437 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-12-31 05:36:58,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:36:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-12-31 05:36:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 05:36:58,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:36:58,438 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:36:58,438 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:36:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:36:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash 802880644, now seen corresponding path program 3 times [2018-12-31 05:36:58,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:36:58,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:36:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:58,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:36:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:36:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:36:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:36:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:36:59,180 INFO L223 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 [2018-12-31 05:36:59,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:36:59,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:36:59,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:36:59,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:36:59,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:36:59,269 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:36:59,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:59,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2018-12-31 05:36:59,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:36:59,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:59,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:36:59,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-12-31 05:36:59,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:59,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-12-31 05:36:59,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:36:59,883 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:36:59,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-31 05:36:59,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:00,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:00,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:00,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-12-31 05:37:00,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:37:00,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:00,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:00,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:00,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:00,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:37:00,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:00,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:00,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:00,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2018-12-31 05:37:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:00,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:00,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 22 [2018-12-31 05:37:00,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 05:37:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 05:37:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-12-31 05:37:00,530 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 22 states. [2018-12-31 05:37:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:01,665 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-12-31 05:37:01,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 05:37:01,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-12-31 05:37:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:01,667 INFO L225 Difference]: With dead ends: 155 [2018-12-31 05:37:01,667 INFO L226 Difference]: Without dead ends: 153 [2018-12-31 05:37:01,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 05:37:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-31 05:37:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2018-12-31 05:37:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-31 05:37:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2018-12-31 05:37:01,687 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 24 [2018-12-31 05:37:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:01,688 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2018-12-31 05:37:01,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 05:37:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2018-12-31 05:37:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 05:37:01,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:01,691 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:01,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 519508641, now seen corresponding path program 3 times [2018-12-31 05:37:01,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:01,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:01,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:02,142 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-31 05:37:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:02,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:02,194 INFO L223 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 [2018-12-31 05:37:02,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:37:02,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 05:37:02,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:02,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:02,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-31 05:37:02,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 05:37:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 05:37:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:37:02,325 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand 12 states. [2018-12-31 05:37:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:02,521 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2018-12-31 05:37:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:37:02,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-31 05:37:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:02,522 INFO L225 Difference]: With dead ends: 189 [2018-12-31 05:37:02,522 INFO L226 Difference]: Without dead ends: 173 [2018-12-31 05:37:02,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-31 05:37:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-31 05:37:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2018-12-31 05:37:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-31 05:37:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2018-12-31 05:37:02,547 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 27 [2018-12-31 05:37:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:02,548 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2018-12-31 05:37:02,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 05:37:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2018-12-31 05:37:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 05:37:02,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:02,550 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:02,550 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash 862655954, now seen corresponding path program 1 times [2018-12-31 05:37:02,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:02,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:03,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:03,187 INFO L223 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 [2018-12-31 05:37:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:03,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:03,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:03,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:03,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:37:03,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-31 05:37:03,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:03,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-12-31 05:37:03,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:03,514 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:03,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-12-31 05:37:03,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:03,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:03,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-12-31 05:37:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:03,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:03,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-12-31 05:37:03,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-31 05:37:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-31 05:37:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-12-31 05:37:03,818 INFO L87 Difference]: Start difference. First operand 129 states and 157 transitions. Second operand 31 states. [2018-12-31 05:37:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:04,957 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2018-12-31 05:37:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 05:37:04,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 28 [2018-12-31 05:37:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:04,959 INFO L225 Difference]: With dead ends: 146 [2018-12-31 05:37:04,959 INFO L226 Difference]: Without dead ends: 137 [2018-12-31 05:37:04,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 05:37:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-31 05:37:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2018-12-31 05:37:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-31 05:37:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2018-12-31 05:37:04,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 28 [2018-12-31 05:37:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:04,979 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2018-12-31 05:37:04,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-31 05:37:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2018-12-31 05:37:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 05:37:04,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:04,980 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:04,981 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1474562622, now seen corresponding path program 4 times [2018-12-31 05:37:04,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:04,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:04,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:04,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:05,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:05,611 INFO L223 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 [2018-12-31 05:37:05,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:37:05,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:37:05,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:05,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:05,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 05:37:05,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:37:05,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:05,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:05,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:05,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-31 05:37:06,315 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 05:37:06,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:06,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:06,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:06,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-31 05:37:06,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:06,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:06,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:06,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:06,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:06,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:06,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-31 05:37:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:06,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-12-31 05:37:06,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-31 05:37:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-31 05:37:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2018-12-31 05:37:06,733 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 29 states. [2018-12-31 05:37:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:08,230 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2018-12-31 05:37:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 05:37:08,231 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-31 05:37:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:08,233 INFO L225 Difference]: With dead ends: 259 [2018-12-31 05:37:08,233 INFO L226 Difference]: Without dead ends: 194 [2018-12-31 05:37:08,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 05:37:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-31 05:37:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-12-31 05:37:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-31 05:37:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2018-12-31 05:37:08,257 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 29 [2018-12-31 05:37:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:08,258 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2018-12-31 05:37:08,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-31 05:37:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-12-31 05:37:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 05:37:08,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:08,261 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:08,262 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 219109591, now seen corresponding path program 4 times [2018-12-31 05:37:08,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:08,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:08,662 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-31 05:37:09,209 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-12-31 05:37:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:09,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:09,460 INFO L223 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 [2018-12-31 05:37:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:37:09,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:37:09,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:09,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:09,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:09,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:09,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:37:09,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:09,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:09,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:09,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-31 05:37:09,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:09,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-12-31 05:37:09,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:09,746 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:09,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-31 05:37:09,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:09,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:09,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:09,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2018-12-31 05:37:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 05:37:09,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:09,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-12-31 05:37:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-31 05:37:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-31 05:37:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:37:09,888 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand 24 states. [2018-12-31 05:37:10,209 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-12-31 05:37:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:13,520 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2018-12-31 05:37:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 05:37:13,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-31 05:37:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:13,523 INFO L225 Difference]: With dead ends: 215 [2018-12-31 05:37:13,523 INFO L226 Difference]: Without dead ends: 150 [2018-12-31 05:37:13,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=416, Invalid=2235, Unknown=1, NotChecked=0, Total=2652 [2018-12-31 05:37:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-31 05:37:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-12-31 05:37:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-31 05:37:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2018-12-31 05:37:13,564 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 29 [2018-12-31 05:37:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:13,564 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2018-12-31 05:37:13,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-31 05:37:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2018-12-31 05:37:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 05:37:13,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:13,567 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:13,567 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1586454183, now seen corresponding path program 1 times [2018-12-31 05:37:13,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:13,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:13,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:14,226 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-12-31 05:37:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:14,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:14,837 INFO L223 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 [2018-12-31 05:37:14,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:14,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:15,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-31 05:37:15,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-31 05:37:15,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2018-12-31 05:37:15,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:15,183 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-31 05:37:15,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-12-31 05:37:15,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-12-31 05:37:15,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:15,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:15,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:15,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:15,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-31 05:37:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 05:37:15,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-12-31 05:37:15,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 05:37:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 05:37:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-12-31 05:37:15,351 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand 21 states. [2018-12-31 05:37:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:16,256 INFO L93 Difference]: Finished difference Result 238 states and 282 transitions. [2018-12-31 05:37:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 05:37:16,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-31 05:37:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:16,259 INFO L225 Difference]: With dead ends: 238 [2018-12-31 05:37:16,259 INFO L226 Difference]: Without dead ends: 201 [2018-12-31 05:37:16,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 05:37:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-31 05:37:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 138. [2018-12-31 05:37:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-31 05:37:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-12-31 05:37:16,287 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 30 [2018-12-31 05:37:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:16,287 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-12-31 05:37:16,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 05:37:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-12-31 05:37:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 05:37:16,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:16,288 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:16,288 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash -828731857, now seen corresponding path program 2 times [2018-12-31 05:37:16,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:16,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:16,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:16,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:16,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:16,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:16,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:16,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:17,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:17,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:17,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:17,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:17,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:17,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:17,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-12-31 05:37:17,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:17,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:17,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:17,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:17,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:17,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:17,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:17,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:17,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-12-31 05:37:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-12-31 05:37:17,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-31 05:37:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-31 05:37:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-12-31 05:37:17,228 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 23 states. [2018-12-31 05:37:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:18,492 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2018-12-31 05:37:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 05:37:18,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-12-31 05:37:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:18,494 INFO L225 Difference]: With dead ends: 239 [2018-12-31 05:37:18,494 INFO L226 Difference]: Without dead ends: 202 [2018-12-31 05:37:18,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2018-12-31 05:37:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-31 05:37:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2018-12-31 05:37:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-31 05:37:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2018-12-31 05:37:18,527 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 30 [2018-12-31 05:37:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:18,527 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2018-12-31 05:37:18,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-31 05:37:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2018-12-31 05:37:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 05:37:18,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:18,528 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:18,529 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1196943461, now seen corresponding path program 3 times [2018-12-31 05:37:18,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:18,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:18,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:19,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:19,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:37:19,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-31 05:37:19,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:19,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:19,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:19,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:19,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-31 05:37:19,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:19,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:19,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2018-12-31 05:37:19,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-31 05:37:19,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-12-31 05:37:19,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-12-31 05:37:19,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:19,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:19,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:19,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:19,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-12-31 05:37:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:19,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2018-12-31 05:37:19,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 05:37:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 05:37:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-12-31 05:37:19,945 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 25 states. [2018-12-31 05:37:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:21,172 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2018-12-31 05:37:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 05:37:21,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-31 05:37:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:21,174 INFO L225 Difference]: With dead ends: 287 [2018-12-31 05:37:21,174 INFO L226 Difference]: Without dead ends: 238 [2018-12-31 05:37:21,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2018-12-31 05:37:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-31 05:37:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 168. [2018-12-31 05:37:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-31 05:37:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2018-12-31 05:37:21,205 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 31 [2018-12-31 05:37:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:21,205 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2018-12-31 05:37:21,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 05:37:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2018-12-31 05:37:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 05:37:21,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:21,206 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:21,207 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1597202772, now seen corresponding path program 5 times [2018-12-31 05:37:21,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:21,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:21,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:21,727 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-12-31 05:37:22,042 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 05:37:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:22,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:22,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 05:37:22,331 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-31 05:37:22,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:22,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:22,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 05:37:22,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:37:22,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:22,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:22,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:22,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-12-31 05:37:22,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:22,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:22,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:22,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:22,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:22,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-31 05:37:23,126 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 05:37:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:23,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-12-31 05:37:23,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-31 05:37:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-31 05:37:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-12-31 05:37:23,673 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 32 states. [2018-12-31 05:37:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:24,968 INFO L93 Difference]: Finished difference Result 343 states and 415 transitions. [2018-12-31 05:37:24,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 05:37:24,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2018-12-31 05:37:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:24,972 INFO L225 Difference]: With dead ends: 343 [2018-12-31 05:37:24,972 INFO L226 Difference]: Without dead ends: 294 [2018-12-31 05:37:24,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2018-12-31 05:37:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-31 05:37:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 201. [2018-12-31 05:37:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-31 05:37:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2018-12-31 05:37:25,025 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 33 [2018-12-31 05:37:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:25,026 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2018-12-31 05:37:25,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-31 05:37:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2018-12-31 05:37:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 05:37:25,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:25,029 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:25,030 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash -629949587, now seen corresponding path program 1 times [2018-12-31 05:37:25,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:25,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:25,530 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-12-31 05:37:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:26,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:26,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:26,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:27,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:27,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:27,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2018-12-31 05:37:27,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-12-31 05:37:27,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:27,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-12-31 05:37:27,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-31 05:37:27,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2018-12-31 05:37:27,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,400 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:27,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,405 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:27,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 117 [2018-12-31 05:37:27,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:27,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:27,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:54 [2018-12-31 05:37:27,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-12-31 05:37:27,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:27,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 125 [2018-12-31 05:37:27,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-31 05:37:27,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:37:27,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-31 05:37:27,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:85 [2018-12-31 05:37:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:28,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:28,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2018-12-31 05:37:28,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 05:37:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 05:37:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 05:37:28,007 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand 36 states. [2018-12-31 05:37:29,035 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-12-31 05:37:30,276 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2018-12-31 05:37:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:31,141 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2018-12-31 05:37:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-31 05:37:31,150 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 33 [2018-12-31 05:37:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:31,152 INFO L225 Difference]: With dead ends: 241 [2018-12-31 05:37:31,153 INFO L226 Difference]: Without dead ends: 232 [2018-12-31 05:37:31,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=437, Invalid=3469, Unknown=0, NotChecked=0, Total=3906 [2018-12-31 05:37:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-31 05:37:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2018-12-31 05:37:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-31 05:37:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 259 transitions. [2018-12-31 05:37:31,213 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 259 transitions. Word has length 33 [2018-12-31 05:37:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:31,213 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 259 transitions. [2018-12-31 05:37:31,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 05:37:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 259 transitions. [2018-12-31 05:37:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:37:31,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:31,214 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:31,214 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1109632707, now seen corresponding path program 1 times [2018-12-31 05:37:31,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:31,512 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-12-31 05:37:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:31,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:31,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:31,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:31,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:32,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:32,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:32,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:32,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:32,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:32,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:32,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-31 05:37:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-12-31 05:37:32,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-31 05:37:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-31 05:37:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-31 05:37:32,362 INFO L87 Difference]: Start difference. First operand 214 states and 259 transitions. Second operand 28 states. [2018-12-31 05:37:33,738 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-31 05:37:34,795 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 05:37:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:35,426 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2018-12-31 05:37:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-31 05:37:35,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-12-31 05:37:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:35,431 INFO L225 Difference]: With dead ends: 422 [2018-12-31 05:37:35,431 INFO L226 Difference]: Without dead ends: 373 [2018-12-31 05:37:35,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2018-12-31 05:37:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-12-31 05:37:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 234. [2018-12-31 05:37:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-31 05:37:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2018-12-31 05:37:35,498 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 34 [2018-12-31 05:37:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:35,499 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2018-12-31 05:37:35,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-31 05:37:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2018-12-31 05:37:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:37:35,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:35,503 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:35,503 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -835418939, now seen corresponding path program 2 times [2018-12-31 05:37:35,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:36,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:36,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:36,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:36,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:36,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:36,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:36,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:36,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:37:36,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:36,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:36,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:36,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-31 05:37:37,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-12-31 05:37:37,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,097 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:37,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-31 05:37:37,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-12-31 05:37:37,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-31 05:37:37,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:37,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-12-31 05:37:37,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:37,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-12-31 05:37:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:37,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:37,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-12-31 05:37:37,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 05:37:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 05:37:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 05:37:37,469 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 36 states. [2018-12-31 05:37:38,565 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 05:37:38,859 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-31 05:37:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:38,894 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2018-12-31 05:37:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 05:37:38,896 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2018-12-31 05:37:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:38,899 INFO L225 Difference]: With dead ends: 265 [2018-12-31 05:37:38,899 INFO L226 Difference]: Without dead ends: 263 [2018-12-31 05:37:38,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2018-12-31 05:37:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-31 05:37:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2018-12-31 05:37:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-31 05:37:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 281 transitions. [2018-12-31 05:37:38,972 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 281 transitions. Word has length 34 [2018-12-31 05:37:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:38,972 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 281 transitions. [2018-12-31 05:37:38,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 05:37:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 281 transitions. [2018-12-31 05:37:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 05:37:38,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:38,976 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:38,976 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash -703579894, now seen corresponding path program 5 times [2018-12-31 05:37:38,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:38,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:38,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:38,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:39,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:39,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 05:37:39,880 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 05:37:39,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:39,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:39,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:40,005 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:40,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2018-12-31 05:37:40,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-31 05:37:40,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-12-31 05:37:40,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-31 05:37:40,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:40,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2018-12-31 05:37:40,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:37:40,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:40,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:37:40,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:40,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-12-31 05:37:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:37:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:40,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-12-31 05:37:40,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 05:37:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 05:37:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-12-31 05:37:40,311 INFO L87 Difference]: Start difference. First operand 231 states and 281 transitions. Second operand 25 states. [2018-12-31 05:37:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:41,710 INFO L93 Difference]: Finished difference Result 379 states and 455 transitions. [2018-12-31 05:37:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-31 05:37:41,713 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-12-31 05:37:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:41,715 INFO L225 Difference]: With dead ends: 379 [2018-12-31 05:37:41,715 INFO L226 Difference]: Without dead ends: 330 [2018-12-31 05:37:41,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2018-12-31 05:37:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-31 05:37:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 232. [2018-12-31 05:37:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-31 05:37:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2018-12-31 05:37:41,775 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 35 [2018-12-31 05:37:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:41,775 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2018-12-31 05:37:41,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 05:37:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2018-12-31 05:37:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 05:37:41,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:41,776 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:41,777 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:41,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1456121544, now seen corresponding path program 1 times [2018-12-31 05:37:41,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:41,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:41,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:42,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:42,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:42,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:42,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:42,843 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:42,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:42,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2018-12-31 05:37:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:42,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:42,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:42,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-12-31 05:37:43,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-12-31 05:37:43,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,063 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:43,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-31 05:37:43,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-12-31 05:37:43,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:37:43,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:37:43,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:43,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-12-31 05:37:43,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:37:43,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:43,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:37:43,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:43,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-12-31 05:37:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 05:37:43,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:43,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-12-31 05:37:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-31 05:37:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-31 05:37:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-12-31 05:37:43,382 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand 28 states. [2018-12-31 05:37:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:44,842 INFO L93 Difference]: Finished difference Result 354 states and 426 transitions. [2018-12-31 05:37:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-31 05:37:44,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-12-31 05:37:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:44,845 INFO L225 Difference]: With dead ends: 354 [2018-12-31 05:37:44,845 INFO L226 Difference]: Without dead ends: 304 [2018-12-31 05:37:44,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2018-12-31 05:37:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-31 05:37:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2018-12-31 05:37:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-31 05:37:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 269 transitions. [2018-12-31 05:37:44,914 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 269 transitions. Word has length 35 [2018-12-31 05:37:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 269 transitions. [2018-12-31 05:37:44,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-31 05:37:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 269 transitions. [2018-12-31 05:37:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 05:37:44,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:44,920 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:44,921 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash -231391894, now seen corresponding path program 6 times [2018-12-31 05:37:44,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:44,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:45,597 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-31 05:37:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:45,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:45,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 05:37:45,802 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-31 05:37:45,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:45,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:45,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-12-31 05:37:45,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 05:37:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 05:37:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-31 05:37:45,933 INFO L87 Difference]: Start difference. First operand 222 states and 269 transitions. Second operand 15 states. [2018-12-31 05:37:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:46,369 INFO L93 Difference]: Finished difference Result 340 states and 404 transitions. [2018-12-31 05:37:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 05:37:46,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-12-31 05:37:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:46,372 INFO L225 Difference]: With dead ends: 340 [2018-12-31 05:37:46,372 INFO L226 Difference]: Without dead ends: 320 [2018-12-31 05:37:46,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-12-31 05:37:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-31 05:37:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 238. [2018-12-31 05:37:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-31 05:37:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2018-12-31 05:37:46,432 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 37 [2018-12-31 05:37:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:46,432 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2018-12-31 05:37:46,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 05:37:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2018-12-31 05:37:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:37:46,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:46,433 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:46,434 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1650333907, now seen corresponding path program 2 times [2018-12-31 05:37:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:46,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:46,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:46,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:46,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:46,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:46,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:46,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:47,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-31 05:37:47,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:47,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-31 05:37:47,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:47,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:47,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:47,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-12-31 05:37:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:47,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:47,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-12-31 05:37:47,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-31 05:37:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-31 05:37:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-31 05:37:47,346 INFO L87 Difference]: Start difference. First operand 238 states and 286 transitions. Second operand 26 states. [2018-12-31 05:37:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:48,430 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2018-12-31 05:37:48,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 05:37:48,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-31 05:37:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:48,433 INFO L225 Difference]: With dead ends: 291 [2018-12-31 05:37:48,433 INFO L226 Difference]: Without dead ends: 278 [2018-12-31 05:37:48,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-12-31 05:37:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-31 05:37:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2018-12-31 05:37:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-31 05:37:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2018-12-31 05:37:48,486 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 38 [2018-12-31 05:37:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:48,486 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2018-12-31 05:37:48,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-31 05:37:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2018-12-31 05:37:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:37:48,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:48,487 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:48,487 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1013617860, now seen corresponding path program 2 times [2018-12-31 05:37:48,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:48,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:48,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:48,849 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 05:37:49,279 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 05:37:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:50,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:50,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:37:50,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:37:50,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:37:50,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:50,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:50,906 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:50,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:50,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2018-12-31 05:37:50,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:50,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:50,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:50,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-31 05:37:51,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-12-31 05:37:51,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-12-31 05:37:51,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-12-31 05:37:51,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-31 05:37:51,197 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:51,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 95 [2018-12-31 05:37:51,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-31 05:37:51,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-12-31 05:37:51,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:51,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:51,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 145 [2018-12-31 05:37:51,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:51,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:51,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:56 [2018-12-31 05:37:51,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-12-31 05:37:51,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:51,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 140 [2018-12-31 05:37:51,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-31 05:37:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:37:52,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-31 05:37:52,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-12-31 05:37:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:52,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:52,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 42 [2018-12-31 05:37:52,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-31 05:37:52,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-31 05:37:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2018-12-31 05:37:52,370 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand 42 states. [2018-12-31 05:37:54,677 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-31 05:37:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:55,297 INFO L93 Difference]: Finished difference Result 255 states and 302 transitions. [2018-12-31 05:37:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 05:37:55,298 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 38 [2018-12-31 05:37:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:55,300 INFO L225 Difference]: With dead ends: 255 [2018-12-31 05:37:55,300 INFO L226 Difference]: Without dead ends: 246 [2018-12-31 05:37:55,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=449, Invalid=3333, Unknown=0, NotChecked=0, Total=3782 [2018-12-31 05:37:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-31 05:37:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2018-12-31 05:37:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-31 05:37:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 261 transitions. [2018-12-31 05:37:55,364 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 261 transitions. Word has length 38 [2018-12-31 05:37:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:55,364 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 261 transitions. [2018-12-31 05:37:55,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-31 05:37:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 261 transitions. [2018-12-31 05:37:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 05:37:55,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:55,369 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:55,369 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1518821945, now seen corresponding path program 7 times [2018-12-31 05:37:55,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:55,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:55,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:37:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:55,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:55,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:55,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:56,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 05:37:56,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:37:56,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-31 05:37:56,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:37:56,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:56,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:37:56,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-31 05:37:56,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:37:56,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:56,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:56,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:56,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:37:56,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:56,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-31 05:37:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:56,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-12-31 05:37:56,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-31 05:37:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-31 05:37:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 05:37:56,720 INFO L87 Difference]: Start difference. First operand 217 states and 261 transitions. Second operand 34 states. [2018-12-31 05:37:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:37:57,726 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2018-12-31 05:37:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 05:37:57,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2018-12-31 05:37:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:37:57,729 INFO L225 Difference]: With dead ends: 291 [2018-12-31 05:37:57,729 INFO L226 Difference]: Without dead ends: 289 [2018-12-31 05:37:57,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=2275, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 05:37:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-31 05:37:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 237. [2018-12-31 05:37:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-31 05:37:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2018-12-31 05:37:57,812 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 39 [2018-12-31 05:37:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:37:57,813 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2018-12-31 05:37:57,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-31 05:37:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2018-12-31 05:37:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 05:37:57,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:37:57,814 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:37:57,814 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:37:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:37:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1558500832, now seen corresponding path program 1 times [2018-12-31 05:37:57,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:37:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:37:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:57,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:37:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:58,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:37:58,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:37:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:37:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:37:58,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:37:58,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:37:58,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:58,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:37:58,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:58,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:58,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:58,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-31 05:37:58,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:58,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-12-31 05:37:58,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:37:58,654 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:37:58,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-31 05:37:58,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:37:58,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:37:58,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:37:58,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:32 [2018-12-31 05:37:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:37:58,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:37:58,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-12-31 05:37:58,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-31 05:37:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-31 05:37:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 05:37:58,934 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 33 states. [2018-12-31 05:38:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:01,039 INFO L93 Difference]: Finished difference Result 368 states and 437 transitions. [2018-12-31 05:38:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-31 05:38:01,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-12-31 05:38:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:01,042 INFO L225 Difference]: With dead ends: 368 [2018-12-31 05:38:01,042 INFO L226 Difference]: Without dead ends: 303 [2018-12-31 05:38:01,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=471, Invalid=3819, Unknown=0, NotChecked=0, Total=4290 [2018-12-31 05:38:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-31 05:38:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2018-12-31 05:38:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-31 05:38:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2018-12-31 05:38:01,121 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 39 [2018-12-31 05:38:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:01,124 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2018-12-31 05:38:01,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-31 05:38:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2018-12-31 05:38:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 05:38:01,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:01,128 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:01,128 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2060667424, now seen corresponding path program 3 times [2018-12-31 05:38:01,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:01,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:01,917 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-12-31 05:38:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:03,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:38:03,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 05:38:03,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:03,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:03,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:38:03,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:38:03,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:03,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:03,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:38:03,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-12-31 05:38:03,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-31 05:38:03,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,293 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:38:03,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2018-12-31 05:38:03,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:03,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:03,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:03,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:46 [2018-12-31 05:38:03,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-31 05:38:03,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:03,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2018-12-31 05:38:03,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-31 05:38:03,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:38:03,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:38:03,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:131 [2018-12-31 05:38:03,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-12-31 05:38:03,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,007 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:38:04,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 93 [2018-12-31 05:38:04,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-12-31 05:38:04,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-31 05:38:04,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:04,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-12-31 05:38:04,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:04,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2018-12-31 05:38:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:04,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:04,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-12-31 05:38:04,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 05:38:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 05:38:04,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 05:38:04,286 INFO L87 Difference]: Start difference. First operand 241 states and 287 transitions. Second operand 36 states. [2018-12-31 05:38:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:06,555 INFO L93 Difference]: Finished difference Result 312 states and 366 transitions. [2018-12-31 05:38:06,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 05:38:06,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2018-12-31 05:38:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:06,559 INFO L225 Difference]: With dead ends: 312 [2018-12-31 05:38:06,559 INFO L226 Difference]: Without dead ends: 303 [2018-12-31 05:38:06,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=408, Invalid=2898, Unknown=0, NotChecked=0, Total=3306 [2018-12-31 05:38:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-31 05:38:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 251. [2018-12-31 05:38:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-31 05:38:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2018-12-31 05:38:06,637 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 39 [2018-12-31 05:38:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:06,637 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2018-12-31 05:38:06,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 05:38:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2018-12-31 05:38:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 05:38:06,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:06,638 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:06,638 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1077848874, now seen corresponding path program 3 times [2018-12-31 05:38:06,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:06,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:06,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:07,079 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2018-12-31 05:38:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:07,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:07,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:07,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:38:07,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 05:38:07,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:07,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:07,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:38:07,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:07,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:38:07,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:07,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:07,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-31 05:38:07,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-31 05:38:07,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:07,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:07,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:07,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-12-31 05:38:07,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-12-31 05:38:08,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-31 05:38:08,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:08,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:08,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:08,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-12-31 05:38:08,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:08,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-12-31 05:38:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:08,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:08,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-12-31 05:38:08,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 05:38:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 05:38:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 05:38:08,343 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 36 states. [2018-12-31 05:38:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:10,631 INFO L93 Difference]: Finished difference Result 504 states and 603 transitions. [2018-12-31 05:38:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-31 05:38:10,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2018-12-31 05:38:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:10,636 INFO L225 Difference]: With dead ends: 504 [2018-12-31 05:38:10,636 INFO L226 Difference]: Without dead ends: 454 [2018-12-31 05:38:10,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=723, Invalid=4827, Unknown=0, NotChecked=0, Total=5550 [2018-12-31 05:38:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-31 05:38:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 314. [2018-12-31 05:38:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-31 05:38:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 376 transitions. [2018-12-31 05:38:10,725 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 376 transitions. Word has length 40 [2018-12-31 05:38:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:10,726 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-12-31 05:38:10,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 05:38:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 376 transitions. [2018-12-31 05:38:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 05:38:10,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:10,727 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:10,727 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1570917360, now seen corresponding path program 4 times [2018-12-31 05:38:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:10,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:11,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:11,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:11,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:38:11,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:38:11,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:11,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:12,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-31 05:38:12,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:12,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-31 05:38:12,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:12,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:12,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:38:12,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-12-31 05:38:12,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:38:12,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:12,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:12,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:12,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-12-31 05:38:12,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:12,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:12,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:38:12,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-12-31 05:38:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:12,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:12,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-12-31 05:38:12,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-31 05:38:12,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-31 05:38:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 05:38:12,518 INFO L87 Difference]: Start difference. First operand 314 states and 376 transitions. Second operand 33 states. [2018-12-31 05:38:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:15,732 INFO L93 Difference]: Finished difference Result 568 states and 686 transitions. [2018-12-31 05:38:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-31 05:38:15,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-12-31 05:38:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:15,737 INFO L225 Difference]: With dead ends: 568 [2018-12-31 05:38:15,737 INFO L226 Difference]: Without dead ends: 506 [2018-12-31 05:38:15,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=729, Invalid=4673, Unknown=0, NotChecked=0, Total=5402 [2018-12-31 05:38:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-31 05:38:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 372. [2018-12-31 05:38:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-31 05:38:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2018-12-31 05:38:15,846 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2018-12-31 05:38:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:15,847 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2018-12-31 05:38:15,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-31 05:38:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2018-12-31 05:38:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 05:38:15,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:15,848 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:15,848 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:15,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1841450632, now seen corresponding path program 3 times [2018-12-31 05:38:15,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:15,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:15,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:15,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:15,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:16,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:16,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:38:16,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 05:38:16,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:16,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:16,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-31 05:38:16,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:16,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-12-31 05:38:16,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:16,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:16,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:16,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-31 05:38:17,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-12-31 05:38:17,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,231 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:38:17,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-31 05:38:17,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-12-31 05:38:17,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:38:17,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:38:17,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2018-12-31 05:38:17,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-12-31 05:38:17,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:17,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-31 05:38:17,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:17,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-12-31 05:38:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:17,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:17,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2018-12-31 05:38:17,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-31 05:38:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-31 05:38:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2018-12-31 05:38:17,737 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 41 states. [2018-12-31 05:38:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:19,441 INFO L93 Difference]: Finished difference Result 457 states and 547 transitions. [2018-12-31 05:38:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-31 05:38:19,443 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-31 05:38:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:19,446 INFO L225 Difference]: With dead ends: 457 [2018-12-31 05:38:19,446 INFO L226 Difference]: Without dead ends: 455 [2018-12-31 05:38:19,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=510, Invalid=3650, Unknown=0, NotChecked=0, Total=4160 [2018-12-31 05:38:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-31 05:38:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 372. [2018-12-31 05:38:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-31 05:38:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2018-12-31 05:38:19,571 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2018-12-31 05:38:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:19,571 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2018-12-31 05:38:19,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-31 05:38:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2018-12-31 05:38:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 05:38:19,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:19,574 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:19,574 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash -506394531, now seen corresponding path program 8 times [2018-12-31 05:38:19,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:19,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:20,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:20,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:20,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:38:20,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:38:20,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:20,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:20,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 05:38:20,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:38:20,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-31 05:38:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-31 05:38:20,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:38:20,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-31 05:38:20,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:38:20,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-31 05:38:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:20,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:20,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-12-31 05:38:20,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-31 05:38:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-31 05:38:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 05:38:20,522 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 33 states. [2018-12-31 05:38:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:21,984 INFO L93 Difference]: Finished difference Result 576 states and 688 transitions. [2018-12-31 05:38:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 05:38:21,985 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-12-31 05:38:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:21,987 INFO L225 Difference]: With dead ends: 576 [2018-12-31 05:38:21,987 INFO L226 Difference]: Without dead ends: 574 [2018-12-31 05:38:21,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=315, Invalid=2337, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 05:38:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-31 05:38:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 429. [2018-12-31 05:38:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-12-31 05:38:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 520 transitions. [2018-12-31 05:38:22,138 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 520 transitions. Word has length 43 [2018-12-31 05:38:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:22,138 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 520 transitions. [2018-12-31 05:38:22,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-31 05:38:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 520 transitions. [2018-12-31 05:38:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 05:38:22,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:22,140 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:22,140 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash 432114678, now seen corresponding path program 2 times [2018-12-31 05:38:22,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:22,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:22,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:22,223 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:38:22,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:38:22 BoogieIcfgContainer [2018-12-31 05:38:22,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:38:22,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:38:22,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:38:22,296 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:38:22,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:36:41" (3/4) ... [2018-12-31 05:38:22,303 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:38:22,391 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:38:22,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:38:22,395 INFO L168 Benchmark]: Toolchain (without parser) took 101972.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 951.4 MB in the beginning and 838.9 MB in the end (delta: 112.5 MB). Peak memory consumption was 595.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:22,395 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:22,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:22,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:22,396 INFO L168 Benchmark]: Boogie Preprocessor took 59.89 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:22,403 INFO L168 Benchmark]: RCFGBuilder took 662.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:22,404 INFO L168 Benchmark]: TraceAbstraction took 100736.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 289.4 MB). Peak memory consumption was 619.2 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:22,404 INFO L168 Benchmark]: Witness Printer took 98.08 ms. Allocated memory is still 1.5 GB. Free memory is still 838.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:22,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.89 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 662.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100736.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 289.4 MB). Peak memory consumption was 619.2 MB. Max. memory is 11.5 GB. * Witness Printer took 98.08 ms. Allocated memory is still 1.5 GB. Free memory is still 838.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND FALSE !(j