./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -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 07be4c432baffc0b0315a344289242773ed6234f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:14:49,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:14:49,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:14:49,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:14:49,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:14:49,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:14:49,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:14:49,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:14:49,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:14:49,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:14:49,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:14:49,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:14:49,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:14:49,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:14:49,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:14:49,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:14:49,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:14:49,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:14:49,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:14:49,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:14:49,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:14:49,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:14:49,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:14:49,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:14:49,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:14:49,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:14:49,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:14:49,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:14:49,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:14:49,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:14:49,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:14:49,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:14:49,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:14:49,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:14:49,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:14:49,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:14:49,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:14:49,802 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:14:49,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:14:49,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:14:49,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:14:49,805 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:14:49,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:14:49,806 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:14:49,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:14:49,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:14:49,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:14:49,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:14:49,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:14:49,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:14:49,808 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:14:49,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:14:49,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:14:49,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:14:49,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:14:49,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:14:49,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:14:49,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:14:49,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:14:49,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:14:49,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:14:49,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:14:49,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:14:49,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:14:49,811 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 -> 07be4c432baffc0b0315a344289242773ed6234f [2019-01-14 15:14:49,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:14:49,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:14:49,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:14:49,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:14:49,894 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:14:49,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2019-01-14 15:14:49,964 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235630911/7b7368aea19e4af9b36135a6968ae8b2/FLAG4b9b2f471 [2019-01-14 15:14:50,624 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:14:50,628 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2019-01-14 15:14:50,659 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235630911/7b7368aea19e4af9b36135a6968ae8b2/FLAG4b9b2f471 [2019-01-14 15:14:50,820 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235630911/7b7368aea19e4af9b36135a6968ae8b2 [2019-01-14 15:14:50,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:14:50,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:14:50,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:14:50,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:14:50,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:14:50,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:14:50" (1/1) ... [2019-01-14 15:14:50,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:50, skipping insertion in model container [2019-01-14 15:14:50,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:14:50" (1/1) ... [2019-01-14 15:14:50,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:14:50,952 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:14:51,508 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:14:51,546 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:14:51,809 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:14:51,835 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:14:51,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51 WrapperNode [2019-01-14 15:14:51,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:14:51,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:14:51,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:14:51,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:14:51,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:51,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:51,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:14:51,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:14:51,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:14:51,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:14:51,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:51,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:51,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:51,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:52,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:52,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:52,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... [2019-01-14 15:14:52,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:14:52,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:14:52,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:14:52,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:14:52,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:14:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:14:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:14:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:14:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:14:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:14:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:14:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:14:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:14:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:14:52,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:14:52,369 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:14:53,966 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 15:14:53,966 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 15:14:53,968 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:14:53,968 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:14:53,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:14:53 BoogieIcfgContainer [2019-01-14 15:14:53,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:14:53,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:14:53,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:14:53,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:14:53,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:14:50" (1/3) ... [2019-01-14 15:14:53,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c960ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:14:53, skipping insertion in model container [2019-01-14 15:14:53,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:14:51" (2/3) ... [2019-01-14 15:14:53,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c960ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:14:53, skipping insertion in model container [2019-01-14 15:14:53,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:14:53" (3/3) ... [2019-01-14 15:14:53,979 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_true-unreach-call.i.cil.c [2019-01-14 15:14:53,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:14:53,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:14:54,015 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:14:54,048 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:14:54,049 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:14:54,049 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:14:54,049 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:14:54,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:14:54,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:14:54,050 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:14:54,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:14:54,050 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:14:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-14 15:14:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:14:54,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:54,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:54,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703966, now seen corresponding path program 1 times [2019-01-14 15:14:54,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:54,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:54,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:54,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:54,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:14:54,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:14:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:14:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:14:54,521 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-01-14 15:14:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:54,762 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-01-14 15:14:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:14:54,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 15:14:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:54,781 INFO L225 Difference]: With dead ends: 375 [2019-01-14 15:14:54,782 INFO L226 Difference]: Without dead ends: 217 [2019-01-14 15:14:54,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:14:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-14 15:14:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-01-14 15:14:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 15:14:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2019-01-14 15:14:54,850 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2019-01-14 15:14:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:54,851 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2019-01-14 15:14:54,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:14:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2019-01-14 15:14:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 15:14:54,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:54,858 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:54,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1688575925, now seen corresponding path program 1 times [2019-01-14 15:14:54,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:54,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:55,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:55,055 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 4 states. [2019-01-14 15:14:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:56,163 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2019-01-14 15:14:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:14:56,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 15:14:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:56,167 INFO L225 Difference]: With dead ends: 359 [2019-01-14 15:14:56,168 INFO L226 Difference]: Without dead ends: 252 [2019-01-14 15:14:56,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:14:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-14 15:14:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2019-01-14 15:14:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:14:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 351 transitions. [2019-01-14 15:14:56,191 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 351 transitions. Word has length 39 [2019-01-14 15:14:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:56,192 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 351 transitions. [2019-01-14 15:14:56,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:14:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 351 transitions. [2019-01-14 15:14:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 15:14:56,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:56,195 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:56,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:56,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:56,196 INFO L82 PathProgramCache]: Analyzing trace with hash 301862275, now seen corresponding path program 1 times [2019-01-14 15:14:56,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:56,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:56,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:56,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:56,368 INFO L87 Difference]: Start difference. First operand 235 states and 351 transitions. Second operand 4 states. [2019-01-14 15:14:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:56,936 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2019-01-14 15:14:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:14:56,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 15:14:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:56,947 INFO L225 Difference]: With dead ends: 376 [2019-01-14 15:14:56,949 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 15:14:56,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:14:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 15:14:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 15:14:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:14:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2019-01-14 15:14:56,989 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 54 [2019-01-14 15:14:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:56,990 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2019-01-14 15:14:56,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:14:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2019-01-14 15:14:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 15:14:56,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:56,999 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:56,999 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 283206817, now seen corresponding path program 1 times [2019-01-14 15:14:57,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:57,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:57,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:57,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:57,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:57,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:57,241 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 4 states. [2019-01-14 15:14:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:57,939 INFO L93 Difference]: Finished difference Result 376 states and 560 transitions. [2019-01-14 15:14:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:14:57,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 15:14:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:57,945 INFO L225 Difference]: With dead ends: 376 [2019-01-14 15:14:57,945 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 15:14:57,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:14:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 15:14:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 15:14:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:14:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2019-01-14 15:14:57,960 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 54 [2019-01-14 15:14:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:57,960 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2019-01-14 15:14:57,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:14:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2019-01-14 15:14:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 15:14:57,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:57,965 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:57,965 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 663043934, now seen corresponding path program 1 times [2019-01-14 15:14:57,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:58,316 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand 4 states. [2019-01-14 15:14:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:59,023 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2019-01-14 15:14:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:14:59,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-14 15:14:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:59,033 INFO L225 Difference]: With dead ends: 376 [2019-01-14 15:14:59,034 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 15:14:59,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:14:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 15:14:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 15:14:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:14:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2019-01-14 15:14:59,051 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 55 [2019-01-14 15:14:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:59,053 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2019-01-14 15:14:59,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:14:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2019-01-14 15:14:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 15:14:59,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:59,062 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:59,064 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1307092358, now seen corresponding path program 1 times [2019-01-14 15:14:59,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:59,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:59,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:59,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:59,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:59,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:59,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:59,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:59,167 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand 4 states. [2019-01-14 15:14:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:59,600 INFO L93 Difference]: Finished difference Result 376 states and 556 transitions. [2019-01-14 15:14:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:14:59,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-14 15:14:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:59,603 INFO L225 Difference]: With dead ends: 376 [2019-01-14 15:14:59,603 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 15:14:59,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:14:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 15:14:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 15:14:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:14:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2019-01-14 15:14:59,612 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 56 [2019-01-14 15:14:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:59,612 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2019-01-14 15:14:59,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:14:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2019-01-14 15:14:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:14:59,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:59,614 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:59,614 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:59,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1551756707, now seen corresponding path program 1 times [2019-01-14 15:14:59,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:14:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:14:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:14:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:14:59,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:14:59,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:14:59,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:14:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:14:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:14:59,947 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand 4 states. [2019-01-14 15:15:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:00,718 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2019-01-14 15:15:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:00,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-14 15:15:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:00,722 INFO L225 Difference]: With dead ends: 367 [2019-01-14 15:15:00,722 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 15:15:00,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 15:15:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2019-01-14 15:15:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 15:15:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2019-01-14 15:15:00,730 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 57 [2019-01-14 15:15:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:00,730 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2019-01-14 15:15:00,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2019-01-14 15:15:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:15:00,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:00,732 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:00,732 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1647854530, now seen corresponding path program 1 times [2019-01-14 15:15:00,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:15:00,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:00,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:15:00,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:15:00,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:15:00,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:15:00,856 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand 3 states. [2019-01-14 15:15:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:00,963 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-01-14 15:15:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:15:00,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 15:15:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:00,966 INFO L225 Difference]: With dead ends: 483 [2019-01-14 15:15:00,966 INFO L226 Difference]: Without dead ends: 358 [2019-01-14 15:15:00,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:15:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-14 15:15:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-01-14 15:15:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-01-14 15:15:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-01-14 15:15:00,978 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 57 [2019-01-14 15:15:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:00,980 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-01-14 15:15:00,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:15:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-01-14 15:15:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:15:00,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:00,981 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:00,983 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2082669569, now seen corresponding path program 1 times [2019-01-14 15:15:00,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:00,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:00,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:15:01,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:01,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:01,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:01,097 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 4 states. [2019-01-14 15:15:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:02,511 INFO L93 Difference]: Finished difference Result 989 states and 1463 transitions. [2019-01-14 15:15:02,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:02,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:15:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:02,518 INFO L225 Difference]: With dead ends: 989 [2019-01-14 15:15:02,518 INFO L226 Difference]: Without dead ends: 638 [2019-01-14 15:15:02,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-01-14 15:15:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 421. [2019-01-14 15:15:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-14 15:15:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-01-14 15:15:02,536 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 77 [2019-01-14 15:15:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-01-14 15:15:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-01-14 15:15:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 15:15:02,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:02,539 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:02,539 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash 33281727, now seen corresponding path program 1 times [2019-01-14 15:15:02,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:02,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:02,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:02,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:02,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:02,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:02,858 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-01-14 15:15:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:03,669 INFO L93 Difference]: Finished difference Result 975 states and 1463 transitions. [2019-01-14 15:15:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:03,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 15:15:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:03,673 INFO L225 Difference]: With dead ends: 975 [2019-01-14 15:15:03,674 INFO L226 Difference]: Without dead ends: 561 [2019-01-14 15:15:03,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-01-14 15:15:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 487. [2019-01-14 15:15:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 746 transitions. [2019-01-14 15:15:03,693 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 746 transitions. Word has length 77 [2019-01-14 15:15:03,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:03,694 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 746 transitions. [2019-01-14 15:15:03,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 746 transitions. [2019-01-14 15:15:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:15:03,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:03,697 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:03,697 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:03,699 INFO L82 PathProgramCache]: Analyzing trace with hash -409313137, now seen corresponding path program 1 times [2019-01-14 15:15:03,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:03,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:03,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:03,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:03,853 INFO L87 Difference]: Start difference. First operand 487 states and 746 transitions. Second operand 4 states. [2019-01-14 15:15:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:04,543 INFO L93 Difference]: Finished difference Result 1038 states and 1571 transitions. [2019-01-14 15:15:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:04,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:15:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:04,550 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 15:15:04,551 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:15:04,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:15:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 15:15:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 743 transitions. [2019-01-14 15:15:04,573 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 743 transitions. Word has length 92 [2019-01-14 15:15:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:04,573 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 743 transitions. [2019-01-14 15:15:04,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 743 transitions. [2019-01-14 15:15:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:15:04,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:04,577 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:04,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -427968595, now seen corresponding path program 1 times [2019-01-14 15:15:04,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:04,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:04,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:04,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:04,817 INFO L87 Difference]: Start difference. First operand 487 states and 743 transitions. Second operand 4 states. [2019-01-14 15:15:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:06,026 INFO L93 Difference]: Finished difference Result 1038 states and 1565 transitions. [2019-01-14 15:15:06,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:06,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:15:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:06,031 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 15:15:06,031 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:15:06,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:15:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 15:15:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 740 transitions. [2019-01-14 15:15:06,052 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 740 transitions. Word has length 92 [2019-01-14 15:15:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:06,053 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 740 transitions. [2019-01-14 15:15:06,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 740 transitions. [2019-01-14 15:15:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 15:15:06,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:06,056 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:06,056 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 91442642, now seen corresponding path program 1 times [2019-01-14 15:15:06,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:06,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:06,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:06,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:06,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:06,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:06,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:06,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:06,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:06,410 INFO L87 Difference]: Start difference. First operand 487 states and 740 transitions. Second operand 4 states. [2019-01-14 15:15:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:07,091 INFO L93 Difference]: Finished difference Result 1038 states and 1559 transitions. [2019-01-14 15:15:07,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:07,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-14 15:15:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:07,094 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 15:15:07,094 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:15:07,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:15:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 15:15:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 737 transitions. [2019-01-14 15:15:07,112 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 737 transitions. Word has length 93 [2019-01-14 15:15:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:07,112 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 737 transitions. [2019-01-14 15:15:07,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 737 transitions. [2019-01-14 15:15:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 15:15:07,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:07,114 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:07,114 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash 767321490, now seen corresponding path program 1 times [2019-01-14 15:15:07,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:07,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:07,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:07,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:07,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:07,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:07,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:07,298 INFO L87 Difference]: Start difference. First operand 487 states and 737 transitions. Second operand 4 states. [2019-01-14 15:15:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:07,806 INFO L93 Difference]: Finished difference Result 1038 states and 1553 transitions. [2019-01-14 15:15:07,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:07,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-14 15:15:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:07,812 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 15:15:07,812 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 15:15:07,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 15:15:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 15:15:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 734 transitions. [2019-01-14 15:15:07,833 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 734 transitions. Word has length 94 [2019-01-14 15:15:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:07,833 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 734 transitions. [2019-01-14 15:15:07,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 734 transitions. [2019-01-14 15:15:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 15:15:07,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:07,837 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:07,837 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1998728983, now seen corresponding path program 1 times [2019-01-14 15:15:07,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:07,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:08,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:08,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:08,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:08,036 INFO L87 Difference]: Start difference. First operand 487 states and 734 transitions. Second operand 4 states. [2019-01-14 15:15:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:08,710 INFO L93 Difference]: Finished difference Result 1011 states and 1514 transitions. [2019-01-14 15:15:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:08,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 15:15:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:08,716 INFO L225 Difference]: With dead ends: 1011 [2019-01-14 15:15:08,716 INFO L226 Difference]: Without dead ends: 531 [2019-01-14 15:15:08,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-14 15:15:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-01-14 15:15:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 731 transitions. [2019-01-14 15:15:08,736 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 731 transitions. Word has length 95 [2019-01-14 15:15:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:08,736 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 731 transitions. [2019-01-14 15:15:08,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 731 transitions. [2019-01-14 15:15:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 15:15:08,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:08,740 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:08,740 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2138100876, now seen corresponding path program 1 times [2019-01-14 15:15:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:08,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:08,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:08,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:08,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:08,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:08,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:08,894 INFO L87 Difference]: Start difference. First operand 487 states and 731 transitions. Second operand 4 states. [2019-01-14 15:15:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:09,363 INFO L93 Difference]: Finished difference Result 1011 states and 1508 transitions. [2019-01-14 15:15:09,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:09,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 15:15:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:09,366 INFO L225 Difference]: With dead ends: 1011 [2019-01-14 15:15:09,367 INFO L226 Difference]: Without dead ends: 531 [2019-01-14 15:15:09,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-14 15:15:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-01-14 15:15:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 728 transitions. [2019-01-14 15:15:09,386 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 728 transitions. Word has length 95 [2019-01-14 15:15:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:09,386 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 728 transitions. [2019-01-14 15:15:09,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 728 transitions. [2019-01-14 15:15:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:15:09,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:09,390 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:09,390 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1383231823, now seen corresponding path program 1 times [2019-01-14 15:15:09,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:09,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 15:15:09,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:09,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:09,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:09,708 INFO L87 Difference]: Start difference. First operand 487 states and 728 transitions. Second operand 4 states. [2019-01-14 15:15:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:10,129 INFO L93 Difference]: Finished difference Result 999 states and 1485 transitions. [2019-01-14 15:15:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:10,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 15:15:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:10,134 INFO L225 Difference]: With dead ends: 999 [2019-01-14 15:15:10,134 INFO L226 Difference]: Without dead ends: 519 [2019-01-14 15:15:10,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-01-14 15:15:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2019-01-14 15:15:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:15:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 725 transitions. [2019-01-14 15:15:10,152 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 725 transitions. Word has length 96 [2019-01-14 15:15:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:10,154 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 725 transitions. [2019-01-14 15:15:10,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 725 transitions. [2019-01-14 15:15:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:15:10,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:10,157 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:10,157 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1913559489, now seen corresponding path program 1 times [2019-01-14 15:15:10,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 15:15:10,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:15:10,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:15:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:15:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:15:10,260 INFO L87 Difference]: Start difference. First operand 487 states and 725 transitions. Second operand 3 states. [2019-01-14 15:15:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:10,441 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2019-01-14 15:15:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:15:10,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 15:15:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:10,446 INFO L225 Difference]: With dead ends: 655 [2019-01-14 15:15:10,446 INFO L226 Difference]: Without dead ends: 653 [2019-01-14 15:15:10,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:15:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-01-14 15:15:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-01-14 15:15:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-01-14 15:15:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 974 transitions. [2019-01-14 15:15:10,466 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 974 transitions. Word has length 98 [2019-01-14 15:15:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:10,467 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 974 transitions. [2019-01-14 15:15:10,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:15:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 974 transitions. [2019-01-14 15:15:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-14 15:15:10,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:10,471 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:10,472 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1064369176, now seen corresponding path program 1 times [2019-01-14 15:15:10,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:10,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:10,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 15:15:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:10,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:10,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:10,609 INFO L87 Difference]: Start difference. First operand 653 states and 974 transitions. Second operand 4 states. [2019-01-14 15:15:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:11,195 INFO L93 Difference]: Finished difference Result 1508 states and 2249 transitions. [2019-01-14 15:15:11,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:11,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-14 15:15:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:11,202 INFO L225 Difference]: With dead ends: 1508 [2019-01-14 15:15:11,202 INFO L226 Difference]: Without dead ends: 862 [2019-01-14 15:15:11,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-01-14 15:15:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 749. [2019-01-14 15:15:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1142 transitions. [2019-01-14 15:15:11,233 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1142 transitions. Word has length 124 [2019-01-14 15:15:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:11,234 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1142 transitions. [2019-01-14 15:15:11,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1142 transitions. [2019-01-14 15:15:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-14 15:15:11,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:11,238 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:11,239 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1408644718, now seen corresponding path program 1 times [2019-01-14 15:15:11,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:11,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:11,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:11,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:11,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-14 15:15:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:11,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:11,397 INFO L87 Difference]: Start difference. First operand 749 states and 1142 transitions. Second operand 4 states. [2019-01-14 15:15:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:12,012 INFO L93 Difference]: Finished difference Result 1366 states and 2072 transitions. [2019-01-14 15:15:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:12,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-01-14 15:15:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:12,016 INFO L225 Difference]: With dead ends: 1366 [2019-01-14 15:15:12,016 INFO L226 Difference]: Without dead ends: 792 [2019-01-14 15:15:12,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-01-14 15:15:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 749. [2019-01-14 15:15:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1138 transitions. [2019-01-14 15:15:12,039 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1138 transitions. Word has length 136 [2019-01-14 15:15:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:12,039 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1138 transitions. [2019-01-14 15:15:12,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1138 transitions. [2019-01-14 15:15:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 15:15:12,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:12,043 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:12,044 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2057350573, now seen corresponding path program 1 times [2019-01-14 15:15:12,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:12,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:12,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-14 15:15:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:12,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:12,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:12,328 INFO L87 Difference]: Start difference. First operand 749 states and 1138 transitions. Second operand 4 states. [2019-01-14 15:15:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:12,683 INFO L93 Difference]: Finished difference Result 1355 states and 2051 transitions. [2019-01-14 15:15:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:12,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-01-14 15:15:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:12,690 INFO L225 Difference]: With dead ends: 1355 [2019-01-14 15:15:12,690 INFO L226 Difference]: Without dead ends: 781 [2019-01-14 15:15:12,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-01-14 15:15:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 749. [2019-01-14 15:15:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1134 transitions. [2019-01-14 15:15:12,715 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1134 transitions. Word has length 137 [2019-01-14 15:15:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:12,715 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1134 transitions. [2019-01-14 15:15:12,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1134 transitions. [2019-01-14 15:15:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-14 15:15:12,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:12,719 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:12,719 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -757425480, now seen corresponding path program 1 times [2019-01-14 15:15:12,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:12,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:13,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:13,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:13,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:13,030 INFO L87 Difference]: Start difference. First operand 749 states and 1134 transitions. Second operand 4 states. [2019-01-14 15:15:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:14,019 INFO L93 Difference]: Finished difference Result 1600 states and 2393 transitions. [2019-01-14 15:15:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:14,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-01-14 15:15:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:14,028 INFO L225 Difference]: With dead ends: 1600 [2019-01-14 15:15:14,028 INFO L226 Difference]: Without dead ends: 858 [2019-01-14 15:15:14,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-01-14 15:15:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 749. [2019-01-14 15:15:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1130 transitions. [2019-01-14 15:15:14,055 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1130 transitions. Word has length 139 [2019-01-14 15:15:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:14,056 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1130 transitions. [2019-01-14 15:15:14,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1130 transitions. [2019-01-14 15:15:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-14 15:15:14,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:14,060 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:14,060 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138710, now seen corresponding path program 1 times [2019-01-14 15:15:14,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:14,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:14,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:14,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:14,435 INFO L87 Difference]: Start difference. First operand 749 states and 1130 transitions. Second operand 4 states. [2019-01-14 15:15:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:15,475 INFO L93 Difference]: Finished difference Result 1600 states and 2385 transitions. [2019-01-14 15:15:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:15,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-01-14 15:15:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:15,483 INFO L225 Difference]: With dead ends: 1600 [2019-01-14 15:15:15,483 INFO L226 Difference]: Without dead ends: 858 [2019-01-14 15:15:15,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-01-14 15:15:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 749. [2019-01-14 15:15:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1126 transitions. [2019-01-14 15:15:15,509 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1126 transitions. Word has length 139 [2019-01-14 15:15:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:15,509 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1126 transitions. [2019-01-14 15:15:15,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1126 transitions. [2019-01-14 15:15:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-14 15:15:15,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:15,514 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:15,514 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -272303813, now seen corresponding path program 1 times [2019-01-14 15:15:15,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:15,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:15,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:15,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:15,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:15,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:15,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:15,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:15,832 INFO L87 Difference]: Start difference. First operand 749 states and 1126 transitions. Second operand 4 states. [2019-01-14 15:15:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:16,905 INFO L93 Difference]: Finished difference Result 1600 states and 2377 transitions. [2019-01-14 15:15:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:16,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-01-14 15:15:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:16,911 INFO L225 Difference]: With dead ends: 1600 [2019-01-14 15:15:16,911 INFO L226 Difference]: Without dead ends: 858 [2019-01-14 15:15:16,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-01-14 15:15:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 749. [2019-01-14 15:15:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1122 transitions. [2019-01-14 15:15:16,937 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1122 transitions. Word has length 140 [2019-01-14 15:15:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:16,938 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1122 transitions. [2019-01-14 15:15:16,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1122 transitions. [2019-01-14 15:15:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-14 15:15:16,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:16,941 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:16,942 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:16,942 INFO L82 PathProgramCache]: Analyzing trace with hash 516780539, now seen corresponding path program 1 times [2019-01-14 15:15:16,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:16,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:17,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:17,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:17,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:17,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:17,257 INFO L87 Difference]: Start difference. First operand 749 states and 1122 transitions. Second operand 4 states. [2019-01-14 15:15:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:17,901 INFO L93 Difference]: Finished difference Result 1600 states and 2369 transitions. [2019-01-14 15:15:17,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:17,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-01-14 15:15:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:17,907 INFO L225 Difference]: With dead ends: 1600 [2019-01-14 15:15:17,907 INFO L226 Difference]: Without dead ends: 858 [2019-01-14 15:15:17,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-01-14 15:15:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 749. [2019-01-14 15:15:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1118 transitions. [2019-01-14 15:15:17,932 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1118 transitions. Word has length 141 [2019-01-14 15:15:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:17,932 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1118 transitions. [2019-01-14 15:15:17,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1118 transitions. [2019-01-14 15:15:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-14 15:15:17,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:17,937 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:17,937 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1934082496, now seen corresponding path program 1 times [2019-01-14 15:15:17,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:18,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:18,326 INFO L87 Difference]: Start difference. First operand 749 states and 1118 transitions. Second operand 4 states. [2019-01-14 15:15:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:18,999 INFO L93 Difference]: Finished difference Result 1564 states and 2317 transitions. [2019-01-14 15:15:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:19,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-01-14 15:15:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:19,003 INFO L225 Difference]: With dead ends: 1564 [2019-01-14 15:15:19,003 INFO L226 Difference]: Without dead ends: 822 [2019-01-14 15:15:19,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-01-14 15:15:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 749. [2019-01-14 15:15:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-14 15:15:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1114 transitions. [2019-01-14 15:15:19,024 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1114 transitions. Word has length 142 [2019-01-14 15:15:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:19,025 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1114 transitions. [2019-01-14 15:15:19,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1114 transitions. [2019-01-14 15:15:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-14 15:15:19,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:19,027 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:19,027 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 102060125, now seen corresponding path program 1 times [2019-01-14 15:15:19,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-01-14 15:15:19,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:15:19,295 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 [2019-01-14 15:15:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:19,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:15:19,587 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 18 treesize of output 15 [2019-01-14 15:15:19,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:15:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:19,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:19,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:15:19,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:19,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:19,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:19,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:19,942 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-01-14 15:15:19,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 [2019-01-14 15:15:20,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:20,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:20,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 15:15:20,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:20,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:20,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:20,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-01-14 15:15:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-14 15:15:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:15:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:15:20,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:15:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:15:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:15:20,191 INFO L87 Difference]: Start difference. First operand 749 states and 1114 transitions. Second operand 7 states. [2019-01-14 15:15:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:22,616 INFO L93 Difference]: Finished difference Result 2263 states and 3320 transitions. [2019-01-14 15:15:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:15:22,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-01-14 15:15:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:22,628 INFO L225 Difference]: With dead ends: 2263 [2019-01-14 15:15:22,628 INFO L226 Difference]: Without dead ends: 1521 [2019-01-14 15:15:22,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-14 15:15:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-14 15:15:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1317. [2019-01-14 15:15:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-01-14 15:15:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1956 transitions. [2019-01-14 15:15:22,690 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1956 transitions. Word has length 142 [2019-01-14 15:15:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:22,690 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1956 transitions. [2019-01-14 15:15:22,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:15:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1956 transitions. [2019-01-14 15:15:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-14 15:15:22,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:22,696 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:22,696 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1274693558, now seen corresponding path program 1 times [2019-01-14 15:15:22,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:22,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-14 15:15:23,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:23,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:23,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:23,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:23,049 INFO L87 Difference]: Start difference. First operand 1317 states and 1956 transitions. Second operand 4 states. [2019-01-14 15:15:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:23,844 INFO L93 Difference]: Finished difference Result 2794 states and 4149 transitions. [2019-01-14 15:15:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:23,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-01-14 15:15:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:23,851 INFO L225 Difference]: With dead ends: 2794 [2019-01-14 15:15:23,851 INFO L226 Difference]: Without dead ends: 1484 [2019-01-14 15:15:23,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-01-14 15:15:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1397. [2019-01-14 15:15:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2019-01-14 15:15:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2092 transitions. [2019-01-14 15:15:23,905 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2092 transitions. Word has length 143 [2019-01-14 15:15:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:23,906 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2092 transitions. [2019-01-14 15:15:23,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2092 transitions. [2019-01-14 15:15:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-14 15:15:23,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:23,912 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:23,912 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1871704783, now seen corresponding path program 1 times [2019-01-14 15:15:23,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:23,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:23,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 15:15:24,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:24,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:24,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:24,110 INFO L87 Difference]: Start difference. First operand 1397 states and 2092 transitions. Second operand 4 states. [2019-01-14 15:15:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:24,800 INFO L93 Difference]: Finished difference Result 3056 states and 4564 transitions. [2019-01-14 15:15:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:24,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-01-14 15:15:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:24,808 INFO L225 Difference]: With dead ends: 3056 [2019-01-14 15:15:24,808 INFO L226 Difference]: Without dead ends: 1666 [2019-01-14 15:15:24,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-01-14 15:15:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1401. [2019-01-14 15:15:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-01-14 15:15:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2096 transitions. [2019-01-14 15:15:24,893 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2096 transitions. Word has length 144 [2019-01-14 15:15:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 2096 transitions. [2019-01-14 15:15:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2096 transitions. [2019-01-14 15:15:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-14 15:15:24,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:24,899 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:24,900 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1694117789, now seen corresponding path program 1 times [2019-01-14 15:15:24,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:24,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:25,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:25,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:25,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:25,219 INFO L87 Difference]: Start difference. First operand 1401 states and 2096 transitions. Second operand 4 states. [2019-01-14 15:15:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:25,824 INFO L93 Difference]: Finished difference Result 3483 states and 5236 transitions. [2019-01-14 15:15:25,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:25,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-01-14 15:15:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:25,833 INFO L225 Difference]: With dead ends: 3483 [2019-01-14 15:15:25,834 INFO L226 Difference]: Without dead ends: 2089 [2019-01-14 15:15:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2019-01-14 15:15:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1601. [2019-01-14 15:15:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2440 transitions. [2019-01-14 15:15:25,893 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2440 transitions. Word has length 146 [2019-01-14 15:15:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:25,893 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2440 transitions. [2019-01-14 15:15:25,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2440 transitions. [2019-01-14 15:15:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-14 15:15:25,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:25,899 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:25,900 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1828131295, now seen corresponding path program 1 times [2019-01-14 15:15:25,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:25,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:25,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:25,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:26,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:26,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:26,080 INFO L87 Difference]: Start difference. First operand 1601 states and 2440 transitions. Second operand 4 states. [2019-01-14 15:15:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:26,626 INFO L93 Difference]: Finished difference Result 3875 states and 5916 transitions. [2019-01-14 15:15:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:26,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-01-14 15:15:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:26,635 INFO L225 Difference]: With dead ends: 3875 [2019-01-14 15:15:26,635 INFO L226 Difference]: Without dead ends: 2281 [2019-01-14 15:15:26,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-01-14 15:15:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1593. [2019-01-14 15:15:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-01-14 15:15:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2432 transitions. [2019-01-14 15:15:26,691 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2432 transitions. Word has length 146 [2019-01-14 15:15:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:26,691 INFO L480 AbstractCegarLoop]: Abstraction has 1593 states and 2432 transitions. [2019-01-14 15:15:26,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2432 transitions. [2019-01-14 15:15:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 15:15:26,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:26,698 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:26,698 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash -982461866, now seen corresponding path program 1 times [2019-01-14 15:15:26,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:26,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:26,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:26,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:27,021 INFO L87 Difference]: Start difference. First operand 1593 states and 2432 transitions. Second operand 4 states. [2019-01-14 15:15:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:27,999 INFO L93 Difference]: Finished difference Result 3841 states and 5873 transitions. [2019-01-14 15:15:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:28,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-01-14 15:15:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:28,010 INFO L225 Difference]: With dead ends: 3841 [2019-01-14 15:15:28,010 INFO L226 Difference]: Without dead ends: 2255 [2019-01-14 15:15:28,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-01-14 15:15:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1801. [2019-01-14 15:15:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2019-01-14 15:15:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2784 transitions. [2019-01-14 15:15:28,068 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2784 transitions. Word has length 147 [2019-01-14 15:15:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:28,068 INFO L480 AbstractCegarLoop]: Abstraction has 1801 states and 2784 transitions. [2019-01-14 15:15:28,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2784 transitions. [2019-01-14 15:15:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-14 15:15:28,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:28,071 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:28,071 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:28,072 INFO L82 PathProgramCache]: Analyzing trace with hash -841913256, now seen corresponding path program 1 times [2019-01-14 15:15:28,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:28,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:28,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:28,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:28,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:28,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:28,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:28,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:28,248 INFO L87 Difference]: Start difference. First operand 1801 states and 2784 transitions. Second operand 4 states. [2019-01-14 15:15:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:28,782 INFO L93 Difference]: Finished difference Result 4057 states and 6233 transitions. [2019-01-14 15:15:28,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:28,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-01-14 15:15:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:28,791 INFO L225 Difference]: With dead ends: 4057 [2019-01-14 15:15:28,792 INFO L226 Difference]: Without dead ends: 2263 [2019-01-14 15:15:28,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2019-01-14 15:15:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1601. [2019-01-14 15:15:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2440 transitions. [2019-01-14 15:15:28,878 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2440 transitions. Word has length 147 [2019-01-14 15:15:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:28,878 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2440 transitions. [2019-01-14 15:15:28,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2440 transitions. [2019-01-14 15:15:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 15:15:28,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:28,881 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:28,881 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1571908203, now seen corresponding path program 1 times [2019-01-14 15:15:28,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:28,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:29,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:29,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:29,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:29,249 INFO L87 Difference]: Start difference. First operand 1601 states and 2440 transitions. Second operand 4 states. [2019-01-14 15:15:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:30,012 INFO L93 Difference]: Finished difference Result 3853 states and 5877 transitions. [2019-01-14 15:15:30,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:30,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-01-14 15:15:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:30,020 INFO L225 Difference]: With dead ends: 3853 [2019-01-14 15:15:30,020 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:30,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1697. [2019-01-14 15:15:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1697 states. [2019-01-14 15:15:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2576 transitions. [2019-01-14 15:15:30,098 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2576 transitions. Word has length 161 [2019-01-14 15:15:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:30,098 INFO L480 AbstractCegarLoop]: Abstraction has 1697 states and 2576 transitions. [2019-01-14 15:15:30,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2576 transitions. [2019-01-14 15:15:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 15:15:30,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:30,104 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:30,105 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1553252745, now seen corresponding path program 1 times [2019-01-14 15:15:30,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:30,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:30,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:30,497 INFO L87 Difference]: Start difference. First operand 1697 states and 2576 transitions. Second operand 4 states. [2019-01-14 15:15:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:31,473 INFO L93 Difference]: Finished difference Result 3949 states and 6005 transitions. [2019-01-14 15:15:31,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:31,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-01-14 15:15:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:31,478 INFO L225 Difference]: With dead ends: 3949 [2019-01-14 15:15:31,478 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:31,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1705. [2019-01-14 15:15:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-01-14 15:15:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2584 transitions. [2019-01-14 15:15:31,530 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2584 transitions. Word has length 161 [2019-01-14 15:15:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:31,531 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2584 transitions. [2019-01-14 15:15:31,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2584 transitions. [2019-01-14 15:15:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 15:15:31,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:31,534 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:31,534 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:31,534 INFO L82 PathProgramCache]: Analyzing trace with hash -273458963, now seen corresponding path program 1 times [2019-01-14 15:15:31,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:31,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:31,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:31,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:31,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:31,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:31,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:31,719 INFO L87 Difference]: Start difference. First operand 1705 states and 2584 transitions. Second operand 4 states. [2019-01-14 15:15:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:32,472 INFO L93 Difference]: Finished difference Result 3957 states and 6005 transitions. [2019-01-14 15:15:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:32,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-01-14 15:15:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:32,478 INFO L225 Difference]: With dead ends: 3957 [2019-01-14 15:15:32,479 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:32,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1705. [2019-01-14 15:15:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-01-14 15:15:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2576 transitions. [2019-01-14 15:15:32,548 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2576 transitions. Word has length 161 [2019-01-14 15:15:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2576 transitions. [2019-01-14 15:15:32,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2576 transitions. [2019-01-14 15:15:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 15:15:32,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:32,553 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:32,553 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash -292114421, now seen corresponding path program 1 times [2019-01-14 15:15:32,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:32,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:32,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:32,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:32,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:32,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:32,926 INFO L87 Difference]: Start difference. First operand 1705 states and 2576 transitions. Second operand 4 states. [2019-01-14 15:15:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:33,511 INFO L93 Difference]: Finished difference Result 3957 states and 5989 transitions. [2019-01-14 15:15:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:33,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-01-14 15:15:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:33,517 INFO L225 Difference]: With dead ends: 3957 [2019-01-14 15:15:33,518 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:33,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1601. [2019-01-14 15:15:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2424 transitions. [2019-01-14 15:15:33,601 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2424 transitions. Word has length 161 [2019-01-14 15:15:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:33,602 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2424 transitions. [2019-01-14 15:15:33,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2424 transitions. [2019-01-14 15:15:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-14 15:15:33,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:33,608 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:33,608 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1379762038, now seen corresponding path program 1 times [2019-01-14 15:15:33,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:33,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:33,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:33,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:33,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:33,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:33,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:33,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:33,869 INFO L87 Difference]: Start difference. First operand 1601 states and 2424 transitions. Second operand 4 states. [2019-01-14 15:15:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:34,391 INFO L93 Difference]: Finished difference Result 3853 states and 5829 transitions. [2019-01-14 15:15:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:34,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-01-14 15:15:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:34,397 INFO L225 Difference]: With dead ends: 3853 [2019-01-14 15:15:34,398 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:34,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1713. [2019-01-14 15:15:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-01-14 15:15:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2576 transitions. [2019-01-14 15:15:34,480 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2576 transitions. Word has length 162 [2019-01-14 15:15:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:34,481 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2576 transitions. [2019-01-14 15:15:34,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2576 transitions. [2019-01-14 15:15:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-14 15:15:34,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:34,487 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:34,488 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 7954740, now seen corresponding path program 1 times [2019-01-14 15:15:34,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:34,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:34,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:34,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:34,697 INFO L87 Difference]: Start difference. First operand 1713 states and 2576 transitions. Second operand 4 states. [2019-01-14 15:15:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:35,246 INFO L93 Difference]: Finished difference Result 3965 states and 5973 transitions. [2019-01-14 15:15:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:35,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-01-14 15:15:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:35,251 INFO L225 Difference]: With dead ends: 3965 [2019-01-14 15:15:35,251 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:35,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1601. [2019-01-14 15:15:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2416 transitions. [2019-01-14 15:15:35,359 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2416 transitions. Word has length 162 [2019-01-14 15:15:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:35,359 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2416 transitions. [2019-01-14 15:15:35,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2416 transitions. [2019-01-14 15:15:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-14 15:15:35,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:35,367 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:35,367 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2050517102, now seen corresponding path program 1 times [2019-01-14 15:15:35,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:35,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:35,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:35,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:35,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:35,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:35,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:35,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:35,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:35,561 INFO L87 Difference]: Start difference. First operand 1601 states and 2416 transitions. Second operand 4 states. [2019-01-14 15:15:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:36,185 INFO L93 Difference]: Finished difference Result 3853 states and 5805 transitions. [2019-01-14 15:15:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:36,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-01-14 15:15:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:36,190 INFO L225 Difference]: With dead ends: 3853 [2019-01-14 15:15:36,191 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:36,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1721. [2019-01-14 15:15:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-01-14 15:15:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2576 transitions. [2019-01-14 15:15:36,299 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2576 transitions. Word has length 163 [2019-01-14 15:15:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:36,300 INFO L480 AbstractCegarLoop]: Abstraction has 1721 states and 2576 transitions. [2019-01-14 15:15:36,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2576 transitions. [2019-01-14 15:15:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-14 15:15:36,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:36,307 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:36,308 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1820803472, now seen corresponding path program 1 times [2019-01-14 15:15:36,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:36,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:36,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:36,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:36,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:36,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:36,637 INFO L87 Difference]: Start difference. First operand 1721 states and 2576 transitions. Second operand 4 states. [2019-01-14 15:15:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:37,203 INFO L93 Difference]: Finished difference Result 3973 states and 5957 transitions. [2019-01-14 15:15:37,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:37,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-01-14 15:15:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:37,207 INFO L225 Difference]: With dead ends: 3973 [2019-01-14 15:15:37,207 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:37,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1601. [2019-01-14 15:15:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2408 transitions. [2019-01-14 15:15:37,302 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2408 transitions. Word has length 163 [2019-01-14 15:15:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:37,302 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2408 transitions. [2019-01-14 15:15:37,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2408 transitions. [2019-01-14 15:15:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-14 15:15:37,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:37,308 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:37,308 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1171880005, now seen corresponding path program 1 times [2019-01-14 15:15:37,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:37,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:37,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:37,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:37,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:37,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:37,727 INFO L87 Difference]: Start difference. First operand 1601 states and 2408 transitions. Second operand 4 states. [2019-01-14 15:15:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:38,254 INFO L93 Difference]: Finished difference Result 3817 states and 5737 transitions. [2019-01-14 15:15:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:38,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-01-14 15:15:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:38,257 INFO L225 Difference]: With dead ends: 3817 [2019-01-14 15:15:38,257 INFO L226 Difference]: Without dead ends: 2223 [2019-01-14 15:15:38,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-01-14 15:15:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1729. [2019-01-14 15:15:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2019-01-14 15:15:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2576 transitions. [2019-01-14 15:15:38,316 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2576 transitions. Word has length 164 [2019-01-14 15:15:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:38,317 INFO L480 AbstractCegarLoop]: Abstraction has 1729 states and 2576 transitions. [2019-01-14 15:15:38,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2576 transitions. [2019-01-14 15:15:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-14 15:15:38,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:38,320 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:38,320 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash -923733511, now seen corresponding path program 1 times [2019-01-14 15:15:38,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:38,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:38,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:38,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:38,630 INFO L87 Difference]: Start difference. First operand 1729 states and 2576 transitions. Second operand 4 states. [2019-01-14 15:15:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:39,200 INFO L93 Difference]: Finished difference Result 3945 states and 5897 transitions. [2019-01-14 15:15:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:39,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-01-14 15:15:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:39,204 INFO L225 Difference]: With dead ends: 3945 [2019-01-14 15:15:39,204 INFO L226 Difference]: Without dead ends: 2223 [2019-01-14 15:15:39,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-01-14 15:15:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1601. [2019-01-14 15:15:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2400 transitions. [2019-01-14 15:15:39,271 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2400 transitions. Word has length 164 [2019-01-14 15:15:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:39,272 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2400 transitions. [2019-01-14 15:15:39,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2400 transitions. [2019-01-14 15:15:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-14 15:15:39,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:39,275 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:39,275 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1830368541, now seen corresponding path program 1 times [2019-01-14 15:15:39,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:39,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:39,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:39,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:39,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:39,657 INFO L87 Difference]: Start difference. First operand 1601 states and 2400 transitions. Second operand 4 states. [2019-01-14 15:15:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:40,377 INFO L93 Difference]: Finished difference Result 3817 states and 5713 transitions. [2019-01-14 15:15:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:40,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-14 15:15:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:40,381 INFO L225 Difference]: With dead ends: 3817 [2019-01-14 15:15:40,381 INFO L226 Difference]: Without dead ends: 2223 [2019-01-14 15:15:40,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-01-14 15:15:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1785. [2019-01-14 15:15:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-01-14 15:15:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2672 transitions. [2019-01-14 15:15:40,449 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2672 transitions. Word has length 167 [2019-01-14 15:15:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 1785 states and 2672 transitions. [2019-01-14 15:15:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2672 transitions. [2019-01-14 15:15:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-14 15:15:40,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:40,453 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:40,453 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1571112417, now seen corresponding path program 1 times [2019-01-14 15:15:40,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:40,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:40,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:40,609 INFO L87 Difference]: Start difference. First operand 1785 states and 2672 transitions. Second operand 4 states. [2019-01-14 15:15:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:41,194 INFO L93 Difference]: Finished difference Result 4001 states and 5977 transitions. [2019-01-14 15:15:41,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:41,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-14 15:15:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:41,198 INFO L225 Difference]: With dead ends: 4001 [2019-01-14 15:15:41,199 INFO L226 Difference]: Without dead ends: 2223 [2019-01-14 15:15:41,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-01-14 15:15:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1601. [2019-01-14 15:15:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2392 transitions. [2019-01-14 15:15:41,264 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2392 transitions. Word has length 167 [2019-01-14 15:15:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:41,264 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2392 transitions. [2019-01-14 15:15:41,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2392 transitions. [2019-01-14 15:15:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-14 15:15:41,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:41,267 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:41,268 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash 470341738, now seen corresponding path program 1 times [2019-01-14 15:15:41,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:41,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:41,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:41,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:41,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:41,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:41,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:41,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:41,500 INFO L87 Difference]: Start difference. First operand 1601 states and 2392 transitions. Second operand 4 states. [2019-01-14 15:15:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:42,075 INFO L93 Difference]: Finished difference Result 3793 states and 5661 transitions. [2019-01-14 15:15:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:42,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-01-14 15:15:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:42,079 INFO L225 Difference]: With dead ends: 3793 [2019-01-14 15:15:42,079 INFO L226 Difference]: Without dead ends: 2199 [2019-01-14 15:15:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-01-14 15:15:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1793. [2019-01-14 15:15:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2019-01-14 15:15:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2672 transitions. [2019-01-14 15:15:42,150 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2672 transitions. Word has length 168 [2019-01-14 15:15:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2672 transitions. [2019-01-14 15:15:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2672 transitions. [2019-01-14 15:15:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-14 15:15:42,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:42,154 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:42,154 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1896352856, now seen corresponding path program 1 times [2019-01-14 15:15:42,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:42,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:42,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:42,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:42,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:42,524 INFO L87 Difference]: Start difference. First operand 1793 states and 2672 transitions. Second operand 4 states. [2019-01-14 15:15:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:43,174 INFO L93 Difference]: Finished difference Result 3985 states and 5933 transitions. [2019-01-14 15:15:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:43,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-01-14 15:15:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:43,178 INFO L225 Difference]: With dead ends: 3985 [2019-01-14 15:15:43,178 INFO L226 Difference]: Without dead ends: 2199 [2019-01-14 15:15:43,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-01-14 15:15:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1601. [2019-01-14 15:15:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2384 transitions. [2019-01-14 15:15:43,249 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2384 transitions. Word has length 168 [2019-01-14 15:15:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:43,249 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2384 transitions. [2019-01-14 15:15:43,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2384 transitions. [2019-01-14 15:15:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-14 15:15:43,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:43,252 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:43,253 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1429404775, now seen corresponding path program 1 times [2019-01-14 15:15:43,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:43,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:43,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:43,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:43,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:43,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:43,489 INFO L87 Difference]: Start difference. First operand 1601 states and 2384 transitions. Second operand 4 states. [2019-01-14 15:15:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:44,029 INFO L93 Difference]: Finished difference Result 3456 states and 5136 transitions. [2019-01-14 15:15:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:44,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-01-14 15:15:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:44,033 INFO L225 Difference]: With dead ends: 3456 [2019-01-14 15:15:44,033 INFO L226 Difference]: Without dead ends: 1862 [2019-01-14 15:15:44,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-01-14 15:15:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1601. [2019-01-14 15:15:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2380 transitions. [2019-01-14 15:15:44,104 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2380 transitions. Word has length 176 [2019-01-14 15:15:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:44,104 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2380 transitions. [2019-01-14 15:15:44,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2380 transitions. [2019-01-14 15:15:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-14 15:15:44,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:44,108 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:44,108 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1258654537, now seen corresponding path program 1 times [2019-01-14 15:15:44,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:44,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:44,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:44,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:44,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:44,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:44,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:44,287 INFO L87 Difference]: Start difference. First operand 1601 states and 2380 transitions. Second operand 4 states. [2019-01-14 15:15:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:45,129 INFO L93 Difference]: Finished difference Result 3456 states and 5128 transitions. [2019-01-14 15:15:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:45,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-01-14 15:15:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:45,132 INFO L225 Difference]: With dead ends: 3456 [2019-01-14 15:15:45,133 INFO L226 Difference]: Without dead ends: 1862 [2019-01-14 15:15:45,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-01-14 15:15:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1601. [2019-01-14 15:15:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2376 transitions. [2019-01-14 15:15:45,207 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2376 transitions. Word has length 176 [2019-01-14 15:15:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:45,208 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2376 transitions. [2019-01-14 15:15:45,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2376 transitions. [2019-01-14 15:15:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-14 15:15:45,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:45,211 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:45,211 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1002850277, now seen corresponding path program 1 times [2019-01-14 15:15:45,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:45,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:45,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:45,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:45,385 INFO L87 Difference]: Start difference. First operand 1601 states and 2376 transitions. Second operand 4 states. [2019-01-14 15:15:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:45,845 INFO L93 Difference]: Finished difference Result 3278 states and 4845 transitions. [2019-01-14 15:15:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:45,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-01-14 15:15:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:45,849 INFO L225 Difference]: With dead ends: 3278 [2019-01-14 15:15:45,849 INFO L226 Difference]: Without dead ends: 1684 [2019-01-14 15:15:45,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-01-14 15:15:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1601. [2019-01-14 15:15:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2372 transitions. [2019-01-14 15:15:45,924 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2372 transitions. Word has length 176 [2019-01-14 15:15:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:45,924 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2372 transitions. [2019-01-14 15:15:45,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2372 transitions. [2019-01-14 15:15:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-14 15:15:45,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:45,927 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:45,928 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -832100039, now seen corresponding path program 1 times [2019-01-14 15:15:45,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:45,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:46,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:46,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:46,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:46,135 INFO L87 Difference]: Start difference. First operand 1601 states and 2372 transitions. Second operand 4 states. [2019-01-14 15:15:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:46,541 INFO L93 Difference]: Finished difference Result 3278 states and 4837 transitions. [2019-01-14 15:15:46,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:46,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-01-14 15:15:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:46,545 INFO L225 Difference]: With dead ends: 3278 [2019-01-14 15:15:46,545 INFO L226 Difference]: Without dead ends: 1684 [2019-01-14 15:15:46,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-01-14 15:15:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1601. [2019-01-14 15:15:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2368 transitions. [2019-01-14 15:15:46,626 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2368 transitions. Word has length 176 [2019-01-14 15:15:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:46,626 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2368 transitions. [2019-01-14 15:15:46,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2368 transitions. [2019-01-14 15:15:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-14 15:15:46,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:46,629 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:46,629 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -770439614, now seen corresponding path program 1 times [2019-01-14 15:15:46,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:46,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:46,734 INFO L87 Difference]: Start difference. First operand 1601 states and 2368 transitions. Second operand 4 states. [2019-01-14 15:15:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:47,352 INFO L93 Difference]: Finished difference Result 3456 states and 5104 transitions. [2019-01-14 15:15:47,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:47,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-01-14 15:15:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:47,355 INFO L225 Difference]: With dead ends: 3456 [2019-01-14 15:15:47,355 INFO L226 Difference]: Without dead ends: 1862 [2019-01-14 15:15:47,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-01-14 15:15:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1601. [2019-01-14 15:15:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2364 transitions. [2019-01-14 15:15:47,428 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2364 transitions. Word has length 177 [2019-01-14 15:15:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:47,429 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2364 transitions. [2019-01-14 15:15:47,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2364 transitions. [2019-01-14 15:15:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-14 15:15:47,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:47,432 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:47,432 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -432152064, now seen corresponding path program 1 times [2019-01-14 15:15:47,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:47,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:47,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:47,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-14 15:15:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:47,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:47,578 INFO L87 Difference]: Start difference. First operand 1601 states and 2364 transitions. Second operand 4 states. [2019-01-14 15:15:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:47,981 INFO L93 Difference]: Finished difference Result 3278 states and 4821 transitions. [2019-01-14 15:15:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:47,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-01-14 15:15:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:47,985 INFO L225 Difference]: With dead ends: 3278 [2019-01-14 15:15:47,985 INFO L226 Difference]: Without dead ends: 1684 [2019-01-14 15:15:47,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-01-14 15:15:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1601. [2019-01-14 15:15:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-01-14 15:15:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2360 transitions. [2019-01-14 15:15:48,055 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2360 transitions. Word has length 177 [2019-01-14 15:15:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:48,055 INFO L480 AbstractCegarLoop]: Abstraction has 1601 states and 2360 transitions. [2019-01-14 15:15:48,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2360 transitions. [2019-01-14 15:15:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-14 15:15:48,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:48,058 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:48,058 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1010023821, now seen corresponding path program 1 times [2019-01-14 15:15:48,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:48,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:48,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:15:48,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:48,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:48,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:48,194 INFO L87 Difference]: Start difference. First operand 1601 states and 2360 transitions. Second operand 4 states. [2019-01-14 15:15:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:48,735 INFO L93 Difference]: Finished difference Result 3569 states and 5237 transitions. [2019-01-14 15:15:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:48,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-01-14 15:15:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:48,739 INFO L225 Difference]: With dead ends: 3569 [2019-01-14 15:15:48,739 INFO L226 Difference]: Without dead ends: 1975 [2019-01-14 15:15:48,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-01-14 15:15:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1833. [2019-01-14 15:15:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-01-14 15:15:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2696 transitions. [2019-01-14 15:15:48,818 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2696 transitions. Word has length 177 [2019-01-14 15:15:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:48,818 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2696 transitions. [2019-01-14 15:15:48,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2696 transitions. [2019-01-14 15:15:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-14 15:15:48,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:48,822 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:48,822 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash 376761589, now seen corresponding path program 1 times [2019-01-14 15:15:48,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:48,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:48,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:48,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:15:49,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:15:49,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:15:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:15:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:15:49,081 INFO L87 Difference]: Start difference. First operand 1833 states and 2696 transitions. Second operand 6 states. [2019-01-14 15:15:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:49,774 INFO L93 Difference]: Finished difference Result 3319 states and 4884 transitions. [2019-01-14 15:15:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:15:49,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-01-14 15:15:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:49,777 INFO L225 Difference]: With dead ends: 3319 [2019-01-14 15:15:49,778 INFO L226 Difference]: Without dead ends: 1917 [2019-01-14 15:15:49,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:15:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-01-14 15:15:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1841. [2019-01-14 15:15:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2019-01-14 15:15:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2709 transitions. [2019-01-14 15:15:49,859 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2709 transitions. Word has length 177 [2019-01-14 15:15:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:49,859 INFO L480 AbstractCegarLoop]: Abstraction has 1841 states and 2709 transitions. [2019-01-14 15:15:49,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:15:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2709 transitions. [2019-01-14 15:15:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-14 15:15:49,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:49,863 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:49,863 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2117555904, now seen corresponding path program 1 times [2019-01-14 15:15:49,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:49,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:15:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:15:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:15:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:15:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:15:50,078 INFO L87 Difference]: Start difference. First operand 1841 states and 2709 transitions. Second operand 6 states. [2019-01-14 15:15:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:50,928 INFO L93 Difference]: Finished difference Result 3316 states and 4880 transitions. [2019-01-14 15:15:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:15:50,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-01-14 15:15:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:50,932 INFO L225 Difference]: With dead ends: 3316 [2019-01-14 15:15:50,932 INFO L226 Difference]: Without dead ends: 1914 [2019-01-14 15:15:50,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:15:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-01-14 15:15:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1842. [2019-01-14 15:15:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-01-14 15:15:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2710 transitions. [2019-01-14 15:15:51,013 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2710 transitions. Word has length 178 [2019-01-14 15:15:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:51,013 INFO L480 AbstractCegarLoop]: Abstraction has 1842 states and 2710 transitions. [2019-01-14 15:15:51,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:15:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2710 transitions. [2019-01-14 15:15:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:15:51,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:51,017 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:51,017 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1125299445, now seen corresponding path program 1 times [2019-01-14 15:15:51,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:51,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:51,454 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 15:15:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:15:51,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:51,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:51,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:51,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:51,505 INFO L87 Difference]: Start difference. First operand 1842 states and 2710 transitions. Second operand 4 states. [2019-01-14 15:15:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:52,213 INFO L93 Difference]: Finished difference Result 4364 states and 6458 transitions. [2019-01-14 15:15:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:52,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-14 15:15:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:52,217 INFO L225 Difference]: With dead ends: 4364 [2019-01-14 15:15:52,218 INFO L226 Difference]: Without dead ends: 2538 [2019-01-14 15:15:52,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-01-14 15:15:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2050. [2019-01-14 15:15:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2019-01-14 15:15:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3062 transitions. [2019-01-14 15:15:52,311 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3062 transitions. Word has length 192 [2019-01-14 15:15:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:52,311 INFO L480 AbstractCegarLoop]: Abstraction has 2050 states and 3062 transitions. [2019-01-14 15:15:52,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3062 transitions. [2019-01-14 15:15:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:15:52,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:52,315 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:52,315 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:52,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash -991285939, now seen corresponding path program 1 times [2019-01-14 15:15:52,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:15:52,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:52,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:52,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:52,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:52,666 INFO L87 Difference]: Start difference. First operand 2050 states and 3062 transitions. Second operand 4 states. [2019-01-14 15:15:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:53,592 INFO L93 Difference]: Finished difference Result 4764 states and 7146 transitions. [2019-01-14 15:15:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:53,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-14 15:15:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:53,596 INFO L225 Difference]: With dead ends: 4764 [2019-01-14 15:15:53,597 INFO L226 Difference]: Without dead ends: 2730 [2019-01-14 15:15:53,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-01-14 15:15:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2042. [2019-01-14 15:15:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-01-14 15:15:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3054 transitions. [2019-01-14 15:15:53,726 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3054 transitions. Word has length 192 [2019-01-14 15:15:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:53,727 INFO L480 AbstractCegarLoop]: Abstraction has 2042 states and 3054 transitions. [2019-01-14 15:15:53,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3054 transitions. [2019-01-14 15:15:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:15:53,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:53,731 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:53,731 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash -784997626, now seen corresponding path program 1 times [2019-01-14 15:15:53,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:53,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-14 15:15:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:54,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:54,094 INFO L87 Difference]: Start difference. First operand 2042 states and 3054 transitions. Second operand 4 states. [2019-01-14 15:15:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:54,803 INFO L93 Difference]: Finished difference Result 4329 states and 6462 transitions. [2019-01-14 15:15:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:54,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:15:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:54,807 INFO L225 Difference]: With dead ends: 4329 [2019-01-14 15:15:54,807 INFO L226 Difference]: Without dead ends: 2303 [2019-01-14 15:15:54,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2019-01-14 15:15:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2042. [2019-01-14 15:15:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-01-14 15:15:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3050 transitions. [2019-01-14 15:15:54,899 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3050 transitions. Word has length 193 [2019-01-14 15:15:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:54,899 INFO L480 AbstractCegarLoop]: Abstraction has 2042 states and 3050 transitions. [2019-01-14 15:15:54,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3050 transitions. [2019-01-14 15:15:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:15:54,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:54,902 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:54,902 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:54,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1111981832, now seen corresponding path program 1 times [2019-01-14 15:15:54,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-14 15:15:55,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:55,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:55,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:55,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:55,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:55,027 INFO L87 Difference]: Start difference. First operand 2042 states and 3050 transitions. Second operand 4 states. [2019-01-14 15:15:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:55,471 INFO L93 Difference]: Finished difference Result 4151 states and 6179 transitions. [2019-01-14 15:15:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:55,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:15:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:55,475 INFO L225 Difference]: With dead ends: 4151 [2019-01-14 15:15:55,475 INFO L226 Difference]: Without dead ends: 2125 [2019-01-14 15:15:55,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-01-14 15:15:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2042. [2019-01-14 15:15:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-01-14 15:15:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3046 transitions. [2019-01-14 15:15:55,565 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3046 transitions. Word has length 193 [2019-01-14 15:15:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:55,565 INFO L480 AbstractCegarLoop]: Abstraction has 2042 states and 3046 transitions. [2019-01-14 15:15:55,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3046 transitions. [2019-01-14 15:15:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:15:55,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:55,568 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:55,568 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -528962386, now seen corresponding path program 1 times [2019-01-14 15:15:55,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:55,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:55,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:56,004 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 15:15:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:15:56,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:56,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:56,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:56,109 INFO L87 Difference]: Start difference. First operand 2042 states and 3046 transitions. Second operand 4 states. [2019-01-14 15:15:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:56,753 INFO L93 Difference]: Finished difference Result 4730 states and 7087 transitions. [2019-01-14 15:15:56,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:56,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:15:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:56,759 INFO L225 Difference]: With dead ends: 4730 [2019-01-14 15:15:56,759 INFO L226 Difference]: Without dead ends: 2704 [2019-01-14 15:15:56,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-01-14 15:15:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2234. [2019-01-14 15:15:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:15:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3382 transitions. [2019-01-14 15:15:56,859 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3382 transitions. Word has length 193 [2019-01-14 15:15:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:56,860 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3382 transitions. [2019-01-14 15:15:56,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3382 transitions. [2019-01-14 15:15:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:15:56,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:56,863 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:56,863 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash -669510996, now seen corresponding path program 1 times [2019-01-14 15:15:56,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:56,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:56,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:15:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:57,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:57,170 INFO L87 Difference]: Start difference. First operand 2234 states and 3382 transitions. Second operand 4 states. [2019-01-14 15:15:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:58,230 INFO L93 Difference]: Finished difference Result 4914 states and 7415 transitions. [2019-01-14 15:15:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:58,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:15:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:58,236 INFO L225 Difference]: With dead ends: 4914 [2019-01-14 15:15:58,236 INFO L226 Difference]: Without dead ends: 2696 [2019-01-14 15:15:58,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-01-14 15:15:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2034. [2019-01-14 15:15:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-01-14 15:15:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 3038 transitions. [2019-01-14 15:15:58,385 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 3038 transitions. Word has length 193 [2019-01-14 15:15:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:58,385 INFO L480 AbstractCegarLoop]: Abstraction has 2034 states and 3038 transitions. [2019-01-14 15:15:58,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 3038 transitions. [2019-01-14 15:15:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 15:15:58,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:58,388 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:58,388 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -567143843, now seen corresponding path program 1 times [2019-01-14 15:15:58,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-14 15:15:58,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:58,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:58,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:58,522 INFO L87 Difference]: Start difference. First operand 2034 states and 3038 transitions. Second operand 4 states. [2019-01-14 15:15:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:59,144 INFO L93 Difference]: Finished difference Result 4277 states and 6386 transitions. [2019-01-14 15:15:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:59,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-01-14 15:15:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:59,149 INFO L225 Difference]: With dead ends: 4277 [2019-01-14 15:15:59,149 INFO L226 Difference]: Without dead ends: 2259 [2019-01-14 15:15:59,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-01-14 15:15:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2034. [2019-01-14 15:15:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-01-14 15:15:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 3034 transitions. [2019-01-14 15:15:59,246 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 3034 transitions. Word has length 194 [2019-01-14 15:15:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:15:59,246 INFO L480 AbstractCegarLoop]: Abstraction has 2034 states and 3034 transitions. [2019-01-14 15:15:59,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:15:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 3034 transitions. [2019-01-14 15:15:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 15:15:59,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:15:59,249 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:15:59,250 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:15:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:15:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1890322789, now seen corresponding path program 1 times [2019-01-14 15:15:59,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:15:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:15:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:15:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:15:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:15:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-14 15:15:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:15:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:15:59,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:15:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:15:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:15:59,492 INFO L87 Difference]: Start difference. First operand 2034 states and 3034 transitions. Second operand 4 states. [2019-01-14 15:15:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:15:59,947 INFO L93 Difference]: Finished difference Result 4099 states and 6103 transitions. [2019-01-14 15:15:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:15:59,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-01-14 15:15:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:15:59,951 INFO L225 Difference]: With dead ends: 4099 [2019-01-14 15:15:59,951 INFO L226 Difference]: Without dead ends: 2081 [2019-01-14 15:15:59,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:15:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2019-01-14 15:16:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2034. [2019-01-14 15:16:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-01-14 15:16:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 3030 transitions. [2019-01-14 15:16:00,049 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 3030 transitions. Word has length 194 [2019-01-14 15:16:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:00,049 INFO L480 AbstractCegarLoop]: Abstraction has 2034 states and 3030 transitions. [2019-01-14 15:16:00,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 3030 transitions. [2019-01-14 15:16:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 15:16:00,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:00,052 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:00,053 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1305174696, now seen corresponding path program 1 times [2019-01-14 15:16:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:00,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:16:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:00,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:00,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:00,240 INFO L87 Difference]: Start difference. First operand 2034 states and 3030 transitions. Second operand 4 states. [2019-01-14 15:16:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:00,843 INFO L93 Difference]: Finished difference Result 4728 states and 7078 transitions. [2019-01-14 15:16:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:00,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-01-14 15:16:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:00,848 INFO L225 Difference]: With dead ends: 4728 [2019-01-14 15:16:00,848 INFO L226 Difference]: Without dead ends: 2710 [2019-01-14 15:16:00,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-01-14 15:16:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2122. [2019-01-14 15:16:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-01-14 15:16:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3158 transitions. [2019-01-14 15:16:00,977 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3158 transitions. Word has length 194 [2019-01-14 15:16:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:00,977 INFO L480 AbstractCegarLoop]: Abstraction has 2122 states and 3158 transitions. [2019-01-14 15:16:00,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3158 transitions. [2019-01-14 15:16:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 15:16:00,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:00,981 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:00,981 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2061564730, now seen corresponding path program 1 times [2019-01-14 15:16:00,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:00,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:00,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:00,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:00,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:16:01,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:01,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:01,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:01,137 INFO L87 Difference]: Start difference. First operand 2122 states and 3158 transitions. Second operand 4 states. [2019-01-14 15:16:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:01,877 INFO L93 Difference]: Finished difference Result 4816 states and 7198 transitions. [2019-01-14 15:16:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:01,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-01-14 15:16:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:01,882 INFO L225 Difference]: With dead ends: 4816 [2019-01-14 15:16:01,882 INFO L226 Difference]: Without dead ends: 2710 [2019-01-14 15:16:01,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-01-14 15:16:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2130. [2019-01-14 15:16:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-01-14 15:16:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3166 transitions. [2019-01-14 15:16:02,060 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3166 transitions. Word has length 194 [2019-01-14 15:16:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:02,061 INFO L480 AbstractCegarLoop]: Abstraction has 2130 states and 3166 transitions. [2019-01-14 15:16:02,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3166 transitions. [2019-01-14 15:16:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-14 15:16:02,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:02,064 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:02,064 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1590687445, now seen corresponding path program 1 times [2019-01-14 15:16:02,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:02,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:16:02,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:02,246 INFO L87 Difference]: Start difference. First operand 2130 states and 3166 transitions. Second operand 4 states. [2019-01-14 15:16:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:03,048 INFO L93 Difference]: Finished difference Result 4824 states and 7198 transitions. [2019-01-14 15:16:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:03,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-01-14 15:16:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:03,053 INFO L225 Difference]: With dead ends: 4824 [2019-01-14 15:16:03,053 INFO L226 Difference]: Without dead ends: 2710 [2019-01-14 15:16:03,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-01-14 15:16:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2138. [2019-01-14 15:16:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-01-14 15:16:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3174 transitions. [2019-01-14 15:16:03,201 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3174 transitions. Word has length 195 [2019-01-14 15:16:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:03,201 INFO L480 AbstractCegarLoop]: Abstraction has 2138 states and 3174 transitions. [2019-01-14 15:16:03,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3174 transitions. [2019-01-14 15:16:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-14 15:16:03,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:03,204 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:03,205 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1113318293, now seen corresponding path program 1 times [2019-01-14 15:16:03,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:03,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:03,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:16:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:03,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:03,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:03,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:03,313 INFO L87 Difference]: Start difference. First operand 2138 states and 3174 transitions. Second operand 4 states. [2019-01-14 15:16:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:03,978 INFO L93 Difference]: Finished difference Result 4832 states and 7198 transitions. [2019-01-14 15:16:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:03,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-01-14 15:16:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:03,983 INFO L225 Difference]: With dead ends: 4832 [2019-01-14 15:16:03,983 INFO L226 Difference]: Without dead ends: 2710 [2019-01-14 15:16:03,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-01-14 15:16:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2146. [2019-01-14 15:16:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-01-14 15:16:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3182 transitions. [2019-01-14 15:16:04,090 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3182 transitions. Word has length 196 [2019-01-14 15:16:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:04,091 INFO L480 AbstractCegarLoop]: Abstraction has 2146 states and 3182 transitions. [2019-01-14 15:16:04,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3182 transitions. [2019-01-14 15:16:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-14 15:16:04,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:04,094 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:04,094 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -516813003, now seen corresponding path program 1 times [2019-01-14 15:16:04,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-01-14 15:16:04,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:04,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:04,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:04,214 INFO L87 Difference]: Start difference. First operand 2146 states and 3182 transitions. Second operand 4 states. [2019-01-14 15:16:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:04,770 INFO L93 Difference]: Finished difference Result 4501 states and 6674 transitions. [2019-01-14 15:16:04,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:04,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-01-14 15:16:04,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:04,774 INFO L225 Difference]: With dead ends: 4501 [2019-01-14 15:16:04,774 INFO L226 Difference]: Without dead ends: 2371 [2019-01-14 15:16:04,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-01-14 15:16:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2150. [2019-01-14 15:16:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2019-01-14 15:16:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 3186 transitions. [2019-01-14 15:16:04,883 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 3186 transitions. Word has length 197 [2019-01-14 15:16:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:04,883 INFO L480 AbstractCegarLoop]: Abstraction has 2150 states and 3186 transitions. [2019-01-14 15:16:04,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3186 transitions. [2019-01-14 15:16:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-14 15:16:04,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:04,887 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:04,887 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1002143578, now seen corresponding path program 1 times [2019-01-14 15:16:04,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 15:16:04,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:04,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:04,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:04,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:04,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:04,974 INFO L87 Difference]: Start difference. First operand 2150 states and 3186 transitions. Second operand 4 states. [2019-01-14 15:16:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:05,684 INFO L93 Difference]: Finished difference Result 4812 states and 7162 transitions. [2019-01-14 15:16:05,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:05,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-01-14 15:16:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:05,688 INFO L225 Difference]: With dead ends: 4812 [2019-01-14 15:16:05,689 INFO L226 Difference]: Without dead ends: 2678 [2019-01-14 15:16:05,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2019-01-14 15:16:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2158. [2019-01-14 15:16:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-01-14 15:16:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3194 transitions. [2019-01-14 15:16:05,867 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3194 transitions. Word has length 197 [2019-01-14 15:16:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:05,867 INFO L480 AbstractCegarLoop]: Abstraction has 2158 states and 3194 transitions. [2019-01-14 15:16:05,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3194 transitions. [2019-01-14 15:16:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-14 15:16:05,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:05,871 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:05,871 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1524879988, now seen corresponding path program 1 times [2019-01-14 15:16:05,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:05,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:05,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:05,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-01-14 15:16:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:06,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:06,001 INFO L87 Difference]: Start difference. First operand 2158 states and 3194 transitions. Second operand 4 states. [2019-01-14 15:16:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:06,644 INFO L93 Difference]: Finished difference Result 4509 states and 6676 transitions. [2019-01-14 15:16:06,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:06,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-01-14 15:16:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:06,648 INFO L225 Difference]: With dead ends: 4509 [2019-01-14 15:16:06,648 INFO L226 Difference]: Without dead ends: 2367 [2019-01-14 15:16:06,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-01-14 15:16:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2162. [2019-01-14 15:16:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2162 states. [2019-01-14 15:16:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3198 transitions. [2019-01-14 15:16:06,764 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3198 transitions. Word has length 198 [2019-01-14 15:16:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:06,765 INFO L480 AbstractCegarLoop]: Abstraction has 2162 states and 3198 transitions. [2019-01-14 15:16:06,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3198 transitions. [2019-01-14 15:16:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-14 15:16:06,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:06,768 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:06,768 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1394131264, now seen corresponding path program 1 times [2019-01-14 15:16:06,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:06,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-01-14 15:16:06,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:06,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:06,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:06,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:06,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:06,873 INFO L87 Difference]: Start difference. First operand 2162 states and 3198 transitions. Second operand 4 states. [2019-01-14 15:16:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:07,453 INFO L93 Difference]: Finished difference Result 4513 states and 6676 transitions. [2019-01-14 15:16:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:07,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-01-14 15:16:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:07,456 INFO L225 Difference]: With dead ends: 4513 [2019-01-14 15:16:07,456 INFO L226 Difference]: Without dead ends: 2367 [2019-01-14 15:16:07,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-01-14 15:16:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2166. [2019-01-14 15:16:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-01-14 15:16:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3202 transitions. [2019-01-14 15:16:07,570 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3202 transitions. Word has length 198 [2019-01-14 15:16:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:07,570 INFO L480 AbstractCegarLoop]: Abstraction has 2166 states and 3202 transitions. [2019-01-14 15:16:07,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3202 transitions. [2019-01-14 15:16:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-14 15:16:07,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:07,573 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:07,573 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash -563035748, now seen corresponding path program 1 times [2019-01-14 15:16:07,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:07,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:07,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-01-14 15:16:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:07,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:07,702 INFO L87 Difference]: Start difference. First operand 2166 states and 3202 transitions. Second operand 4 states. [2019-01-14 15:16:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:08,224 INFO L93 Difference]: Finished difference Result 4554 states and 6723 transitions. [2019-01-14 15:16:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:08,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-01-14 15:16:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:08,228 INFO L225 Difference]: With dead ends: 4554 [2019-01-14 15:16:08,228 INFO L226 Difference]: Without dead ends: 2404 [2019-01-14 15:16:08,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2019-01-14 15:16:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2238. [2019-01-14 15:16:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2019-01-14 15:16:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3322 transitions. [2019-01-14 15:16:08,346 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3322 transitions. Word has length 198 [2019-01-14 15:16:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:08,347 INFO L480 AbstractCegarLoop]: Abstraction has 2238 states and 3322 transitions. [2019-01-14 15:16:08,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3322 transitions. [2019-01-14 15:16:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-14 15:16:08,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:08,350 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:08,350 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash 997289168, now seen corresponding path program 1 times [2019-01-14 15:16:08,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:08,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:08,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-01-14 15:16:08,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:08,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:08,458 INFO L87 Difference]: Start difference. First operand 2238 states and 3322 transitions. Second operand 4 states. [2019-01-14 15:16:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:09,014 INFO L93 Difference]: Finished difference Result 4647 states and 6902 transitions. [2019-01-14 15:16:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:09,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-01-14 15:16:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:09,018 INFO L225 Difference]: With dead ends: 4647 [2019-01-14 15:16:09,018 INFO L226 Difference]: Without dead ends: 2425 [2019-01-14 15:16:09,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2019-01-14 15:16:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2234. [2019-01-14 15:16:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:16:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3318 transitions. [2019-01-14 15:16:09,139 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3318 transitions. Word has length 200 [2019-01-14 15:16:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3318 transitions. [2019-01-14 15:16:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3318 transitions. [2019-01-14 15:16:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-14 15:16:09,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:09,143 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:09,143 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1088911914, now seen corresponding path program 1 times [2019-01-14 15:16:09,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:09,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-01-14 15:16:09,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:09,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:09,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:09,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:09,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:09,295 INFO L87 Difference]: Start difference. First operand 2234 states and 3318 transitions. Second operand 4 states. [2019-01-14 15:16:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:09,821 INFO L93 Difference]: Finished difference Result 4594 states and 6795 transitions. [2019-01-14 15:16:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:09,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-01-14 15:16:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:09,825 INFO L225 Difference]: With dead ends: 4594 [2019-01-14 15:16:09,825 INFO L226 Difference]: Without dead ends: 2376 [2019-01-14 15:16:09,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-01-14 15:16:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2234. [2019-01-14 15:16:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:16:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3310 transitions. [2019-01-14 15:16:09,956 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3310 transitions. Word has length 200 [2019-01-14 15:16:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:09,956 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3310 transitions. [2019-01-14 15:16:09,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3310 transitions. [2019-01-14 15:16:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-14 15:16:09,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:09,960 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:09,960 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 671515308, now seen corresponding path program 1 times [2019-01-14 15:16:09,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:09,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-01-14 15:16:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:10,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:10,134 INFO L87 Difference]: Start difference. First operand 2234 states and 3310 transitions. Second operand 4 states. [2019-01-14 15:16:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:10,730 INFO L93 Difference]: Finished difference Result 4618 states and 6811 transitions. [2019-01-14 15:16:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:10,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-01-14 15:16:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:10,734 INFO L225 Difference]: With dead ends: 4618 [2019-01-14 15:16:10,735 INFO L226 Difference]: Without dead ends: 2400 [2019-01-14 15:16:10,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-01-14 15:16:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2234. [2019-01-14 15:16:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:16:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3302 transitions. [2019-01-14 15:16:10,860 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3302 transitions. Word has length 200 [2019-01-14 15:16:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:10,860 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3302 transitions. [2019-01-14 15:16:10,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3302 transitions. [2019-01-14 15:16:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-14 15:16:10,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:10,863 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:10,864 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash -278960597, now seen corresponding path program 1 times [2019-01-14 15:16:10,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:10,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:10,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-01-14 15:16:11,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:11,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:11,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:11,019 INFO L87 Difference]: Start difference. First operand 2234 states and 3302 transitions. Second operand 4 states. [2019-01-14 15:16:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:11,506 INFO L93 Difference]: Finished difference Result 4554 states and 6709 transitions. [2019-01-14 15:16:11,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:11,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-01-14 15:16:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:11,510 INFO L225 Difference]: With dead ends: 4554 [2019-01-14 15:16:11,511 INFO L226 Difference]: Without dead ends: 2336 [2019-01-14 15:16:11,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-01-14 15:16:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2234. [2019-01-14 15:16:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:16:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3294 transitions. [2019-01-14 15:16:11,641 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3294 transitions. Word has length 201 [2019-01-14 15:16:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:11,642 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3294 transitions. [2019-01-14 15:16:11,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3294 transitions. [2019-01-14 15:16:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-14 15:16:11,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:11,645 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:11,645 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash -333353495, now seen corresponding path program 1 times [2019-01-14 15:16:11,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-01-14 15:16:11,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:11,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:11,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:11,856 INFO L87 Difference]: Start difference. First operand 2234 states and 3294 transitions. Second operand 4 states. [2019-01-14 15:16:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:12,427 INFO L93 Difference]: Finished difference Result 4578 states and 6725 transitions. [2019-01-14 15:16:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:12,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-01-14 15:16:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:12,431 INFO L225 Difference]: With dead ends: 4578 [2019-01-14 15:16:12,431 INFO L226 Difference]: Without dead ends: 2360 [2019-01-14 15:16:12,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-01-14 15:16:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2234. [2019-01-14 15:16:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-01-14 15:16:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3286 transitions. [2019-01-14 15:16:12,554 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3286 transitions. Word has length 201 [2019-01-14 15:16:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:12,554 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 3286 transitions. [2019-01-14 15:16:12,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3286 transitions. [2019-01-14 15:16:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-14 15:16:12,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:12,561 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:12,561 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash -597669181, now seen corresponding path program 2 times [2019-01-14 15:16:12,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:12,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 131 proven. 27 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-01-14 15:16:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:16:12,796 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 [2019-01-14 15:16:12,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:16:13,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:16:13,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:16:13,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:16:13,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 130 [2019-01-14 15:16:13,120 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 10 treesize of output 9 [2019-01-14 15:16:13,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 93 [2019-01-14 15:16:13,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2019-01-14 15:16:13,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,170 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 [2019-01-14 15:16:13,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:13,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,203 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,219 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 100 [2019-01-14 15:16:13,228 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 10 treesize of output 9 [2019-01-14 15:16:13,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2019-01-14 15:16:13,254 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:16:13,255 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 44 treesize of output 35 [2019-01-14 15:16:13,256 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2019-01-14 15:16:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2019-01-14 15:16:13,330 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,343 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,348 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,360 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 151 [2019-01-14 15:16:13,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,428 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 125 treesize of output 142 [2019-01-14 15:16:13,429 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,521 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 142 treesize of output 141 [2019-01-14 15:16:13,522 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 105 [2019-01-14 15:16:13,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2019-01-14 15:16:13,631 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,648 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 [2019-01-14 15:16:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:13,667 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,674 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,683 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 150 [2019-01-14 15:16:13,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 138 [2019-01-14 15:16:13,837 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:13,920 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 76 treesize of output 93 [2019-01-14 15:16:13,921 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:13,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-01-14 15:16:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 15:16:14,004 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,014 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 86 [2019-01-14 15:16:14,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,124 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:16:14,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,155 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 134 [2019-01-14 15:16:14,158 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2019-01-14 15:16:14,215 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:16:14,311 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:16:14,353 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 57 treesize of output 53 [2019-01-14 15:16:14,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 15 [2019-01-14 15:16:14,390 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,396 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 [2019-01-14 15:16:14,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 6 [2019-01-14 15:16:14,402 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,407 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 [2019-01-14 15:16:14,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 19 [2019-01-14 15:16:14,435 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,441 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:16:14,453 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 3 variables, input treesize:169, output treesize:39 [2019-01-14 15:16:14,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 [2019-01-14 15:16:14,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:14,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 15:16:14,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:14,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-01-14 15:16:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-01-14 15:16:14,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:16:14,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-01-14 15:16:14,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 15:16:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 15:16:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:16:14,742 INFO L87 Difference]: Start difference. First operand 2234 states and 3286 transitions. Second operand 11 states. [2019-01-14 15:16:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:16,752 INFO L93 Difference]: Finished difference Result 5534 states and 8194 transitions. [2019-01-14 15:16:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 15:16:16,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2019-01-14 15:16:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:16,758 INFO L225 Difference]: With dead ends: 5534 [2019-01-14 15:16:16,758 INFO L226 Difference]: Without dead ends: 3316 [2019-01-14 15:16:16,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:16:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2019-01-14 15:16:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 2490. [2019-01-14 15:16:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-01-14 15:16:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 3676 transitions. [2019-01-14 15:16:16,938 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 3676 transitions. Word has length 207 [2019-01-14 15:16:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:16,938 INFO L480 AbstractCegarLoop]: Abstraction has 2490 states and 3676 transitions. [2019-01-14 15:16:16,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 15:16:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 3676 transitions. [2019-01-14 15:16:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-14 15:16:16,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:16,947 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:16,949 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1352293386, now seen corresponding path program 2 times [2019-01-14 15:16:16,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:16,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:16:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-01-14 15:16:17,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:17,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:16:17,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:16:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:16:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:17,227 INFO L87 Difference]: Start difference. First operand 2490 states and 3676 transitions. Second operand 5 states. [2019-01-14 15:16:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:17,918 INFO L93 Difference]: Finished difference Result 5452 states and 8030 transitions. [2019-01-14 15:16:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:17,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-01-14 15:16:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:17,924 INFO L225 Difference]: With dead ends: 5452 [2019-01-14 15:16:17,924 INFO L226 Difference]: Without dead ends: 2978 [2019-01-14 15:16:17,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:16:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-14 15:16:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2290. [2019-01-14 15:16:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-01-14 15:16:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3340 transitions. [2019-01-14 15:16:18,062 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3340 transitions. Word has length 208 [2019-01-14 15:16:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:18,062 INFO L480 AbstractCegarLoop]: Abstraction has 2290 states and 3340 transitions. [2019-01-14 15:16:18,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:16:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3340 transitions. [2019-01-14 15:16:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-14 15:16:18,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:18,066 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:18,066 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1413772149, now seen corresponding path program 1 times [2019-01-14 15:16:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:18,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:16:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:18,470 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 15:16:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:16:18,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:18,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:18,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:18,678 INFO L87 Difference]: Start difference. First operand 2290 states and 3340 transitions. Second operand 4 states. [2019-01-14 15:16:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:19,371 INFO L93 Difference]: Finished difference Result 5234 states and 7667 transitions. [2019-01-14 15:16:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:19,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-01-14 15:16:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:19,377 INFO L225 Difference]: With dead ends: 5234 [2019-01-14 15:16:19,377 INFO L226 Difference]: Without dead ends: 2960 [2019-01-14 15:16:19,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-01-14 15:16:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2482. [2019-01-14 15:16:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-01-14 15:16:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3652 transitions. [2019-01-14 15:16:19,523 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3652 transitions. Word has length 213 [2019-01-14 15:16:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:19,523 INFO L480 AbstractCegarLoop]: Abstraction has 2482 states and 3652 transitions. [2019-01-14 15:16:19,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3652 transitions. [2019-01-14 15:16:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-14 15:16:19,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:19,527 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:19,527 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 520285811, now seen corresponding path program 1 times [2019-01-14 15:16:19,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:19,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:19,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:16:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:19,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:19,688 INFO L87 Difference]: Start difference. First operand 2482 states and 3652 transitions. Second operand 4 states. [2019-01-14 15:16:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:20,449 INFO L93 Difference]: Finished difference Result 5602 states and 8275 transitions. [2019-01-14 15:16:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:20,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-01-14 15:16:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:20,455 INFO L225 Difference]: With dead ends: 5602 [2019-01-14 15:16:20,455 INFO L226 Difference]: Without dead ends: 3136 [2019-01-14 15:16:20,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2019-01-14 15:16:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2474. [2019-01-14 15:16:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3644 transitions. [2019-01-14 15:16:20,602 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3644 transitions. Word has length 213 [2019-01-14 15:16:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:20,602 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3644 transitions. [2019-01-14 15:16:20,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3644 transitions. [2019-01-14 15:16:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-14 15:16:20,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:20,609 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:20,610 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash 440755474, now seen corresponding path program 1 times [2019-01-14 15:16:20,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:20,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:20,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:16:20,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:20,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:20,915 INFO L87 Difference]: Start difference. First operand 2474 states and 3644 transitions. Second operand 4 states. [2019-01-14 15:16:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:21,685 INFO L93 Difference]: Finished difference Result 5570 states and 8231 transitions. [2019-01-14 15:16:21,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:21,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-01-14 15:16:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:21,691 INFO L225 Difference]: With dead ends: 5570 [2019-01-14 15:16:21,691 INFO L226 Difference]: Without dead ends: 3112 [2019-01-14 15:16:21,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-01-14 15:16:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2658. [2019-01-14 15:16:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-01-14 15:16:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3948 transitions. [2019-01-14 15:16:21,843 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3948 transitions. Word has length 214 [2019-01-14 15:16:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:21,843 INFO L480 AbstractCegarLoop]: Abstraction has 2658 states and 3948 transitions. [2019-01-14 15:16:21,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3948 transitions. [2019-01-14 15:16:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-14 15:16:21,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:21,847 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:21,847 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1487517228, now seen corresponding path program 1 times [2019-01-14 15:16:21,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:21,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-01-14 15:16:22,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:22,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:22,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:22,156 INFO L87 Difference]: Start difference. First operand 2658 states and 3948 transitions. Second operand 4 states. [2019-01-14 15:16:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:22,879 INFO L93 Difference]: Finished difference Result 5754 states and 8535 transitions. [2019-01-14 15:16:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:22,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-01-14 15:16:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:22,884 INFO L225 Difference]: With dead ends: 5754 [2019-01-14 15:16:22,884 INFO L226 Difference]: Without dead ends: 3112 [2019-01-14 15:16:22,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-01-14 15:16:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2474. [2019-01-14 15:16:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3644 transitions. [2019-01-14 15:16:23,079 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3644 transitions. Word has length 214 [2019-01-14 15:16:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:23,079 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3644 transitions. [2019-01-14 15:16:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3644 transitions. [2019-01-14 15:16:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-14 15:16:23,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:23,083 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:23,083 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1458250711, now seen corresponding path program 1 times [2019-01-14 15:16:23,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-14 15:16:23,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:23,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:23,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:23,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:23,214 INFO L87 Difference]: Start difference. First operand 2474 states and 3644 transitions. Second operand 4 states. [2019-01-14 15:16:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:23,710 INFO L93 Difference]: Finished difference Result 5034 states and 7393 transitions. [2019-01-14 15:16:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:23,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-01-14 15:16:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:23,715 INFO L225 Difference]: With dead ends: 5034 [2019-01-14 15:16:23,716 INFO L226 Difference]: Without dead ends: 2576 [2019-01-14 15:16:23,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2019-01-14 15:16:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2474. [2019-01-14 15:16:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3636 transitions. [2019-01-14 15:16:23,862 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3636 transitions. Word has length 218 [2019-01-14 15:16:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:23,863 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3636 transitions. [2019-01-14 15:16:23,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3636 transitions. [2019-01-14 15:16:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-14 15:16:23,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:23,867 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:23,868 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 400412633, now seen corresponding path program 1 times [2019-01-14 15:16:23,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:23,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-14 15:16:23,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:23,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:23,972 INFO L87 Difference]: Start difference. First operand 2474 states and 3636 transitions. Second operand 4 states. [2019-01-14 15:16:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:24,602 INFO L93 Difference]: Finished difference Result 5058 states and 7409 transitions. [2019-01-14 15:16:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:24,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-01-14 15:16:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:24,607 INFO L225 Difference]: With dead ends: 5058 [2019-01-14 15:16:24,607 INFO L226 Difference]: Without dead ends: 2600 [2019-01-14 15:16:24,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2019-01-14 15:16:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2474. [2019-01-14 15:16:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3628 transitions. [2019-01-14 15:16:24,754 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3628 transitions. Word has length 218 [2019-01-14 15:16:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3628 transitions. [2019-01-14 15:16:24,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3628 transitions. [2019-01-14 15:16:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-14 15:16:24,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:24,758 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:24,758 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1035956472, now seen corresponding path program 1 times [2019-01-14 15:16:24,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:24,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-14 15:16:24,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:24,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:24,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:24,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:24,959 INFO L87 Difference]: Start difference. First operand 2474 states and 3628 transitions. Second operand 4 states. [2019-01-14 15:16:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:25,485 INFO L93 Difference]: Finished difference Result 5002 states and 7319 transitions. [2019-01-14 15:16:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:25,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-01-14 15:16:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:25,490 INFO L225 Difference]: With dead ends: 5002 [2019-01-14 15:16:25,490 INFO L226 Difference]: Without dead ends: 2544 [2019-01-14 15:16:25,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-01-14 15:16:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2474. [2019-01-14 15:16:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3620 transitions. [2019-01-14 15:16:25,644 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3620 transitions. Word has length 219 [2019-01-14 15:16:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:25,644 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3620 transitions. [2019-01-14 15:16:25,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3620 transitions. [2019-01-14 15:16:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-14 15:16:25,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:25,648 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:25,648 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:25,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1692252874, now seen corresponding path program 1 times [2019-01-14 15:16:25,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:25,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-14 15:16:25,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:25,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:25,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:25,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:25,942 INFO L87 Difference]: Start difference. First operand 2474 states and 3620 transitions. Second operand 4 states. [2019-01-14 15:16:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:26,471 INFO L93 Difference]: Finished difference Result 5026 states and 7335 transitions. [2019-01-14 15:16:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:26,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-01-14 15:16:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:26,476 INFO L225 Difference]: With dead ends: 5026 [2019-01-14 15:16:26,476 INFO L226 Difference]: Without dead ends: 2568 [2019-01-14 15:16:26,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-01-14 15:16:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2474. [2019-01-14 15:16:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3612 transitions. [2019-01-14 15:16:26,624 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3612 transitions. Word has length 219 [2019-01-14 15:16:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:26,624 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3612 transitions. [2019-01-14 15:16:26,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3612 transitions. [2019-01-14 15:16:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-14 15:16:26,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:26,628 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:26,628 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1793788227, now seen corresponding path program 2 times [2019-01-14 15:16:26,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:26,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:16:26,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:26,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:26,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:26,858 INFO L87 Difference]: Start difference. First operand 2474 states and 3612 transitions. Second operand 4 states. [2019-01-14 15:16:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:27,594 INFO L93 Difference]: Finished difference Result 5566 states and 8155 transitions. [2019-01-14 15:16:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:27,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-14 15:16:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:27,600 INFO L225 Difference]: With dead ends: 5566 [2019-01-14 15:16:27,600 INFO L226 Difference]: Without dead ends: 3108 [2019-01-14 15:16:27,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-01-14 15:16:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2570. [2019-01-14 15:16:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-01-14 15:16:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3748 transitions. [2019-01-14 15:16:27,757 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3748 transitions. Word has length 228 [2019-01-14 15:16:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:27,758 INFO L480 AbstractCegarLoop]: Abstraction has 2570 states and 3748 transitions. [2019-01-14 15:16:27,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3748 transitions. [2019-01-14 15:16:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-14 15:16:27,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:27,761 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:27,762 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash 136961631, now seen corresponding path program 1 times [2019-01-14 15:16:27,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:27,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:16:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:27,992 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 15:16:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:16:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:28,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:28,037 INFO L87 Difference]: Start difference. First operand 2570 states and 3748 transitions. Second operand 4 states. [2019-01-14 15:16:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:28,763 INFO L93 Difference]: Finished difference Result 5662 states and 8283 transitions. [2019-01-14 15:16:28,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:28,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-14 15:16:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:28,769 INFO L225 Difference]: With dead ends: 5662 [2019-01-14 15:16:28,769 INFO L226 Difference]: Without dead ends: 3108 [2019-01-14 15:16:28,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-01-14 15:16:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2578. [2019-01-14 15:16:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-01-14 15:16:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3756 transitions. [2019-01-14 15:16:28,932 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3756 transitions. Word has length 228 [2019-01-14 15:16:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:28,932 INFO L480 AbstractCegarLoop]: Abstraction has 2578 states and 3756 transitions. [2019-01-14 15:16:28,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3756 transitions. [2019-01-14 15:16:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-14 15:16:28,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:28,936 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:28,937 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1995612161, now seen corresponding path program 2 times [2019-01-14 15:16:28,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:28,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:28,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:16:29,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:29,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:29,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:29,270 INFO L87 Difference]: Start difference. First operand 2578 states and 3756 transitions. Second operand 4 states. [2019-01-14 15:16:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:30,001 INFO L93 Difference]: Finished difference Result 5670 states and 8283 transitions. [2019-01-14 15:16:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:30,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-14 15:16:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:30,008 INFO L225 Difference]: With dead ends: 5670 [2019-01-14 15:16:30,008 INFO L226 Difference]: Without dead ends: 3108 [2019-01-14 15:16:30,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-01-14 15:16:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2578. [2019-01-14 15:16:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-01-14 15:16:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3748 transitions. [2019-01-14 15:16:30,168 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3748 transitions. Word has length 228 [2019-01-14 15:16:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:30,168 INFO L480 AbstractCegarLoop]: Abstraction has 2578 states and 3748 transitions. [2019-01-14 15:16:30,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3748 transitions. [2019-01-14 15:16:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-14 15:16:30,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:30,172 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:30,173 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash -64862303, now seen corresponding path program 1 times [2019-01-14 15:16:30,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:30,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:16:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-14 15:16:30,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:30,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:16:30,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:16:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:16:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:16:30,283 INFO L87 Difference]: Start difference. First operand 2578 states and 3748 transitions. Second operand 4 states. [2019-01-14 15:16:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:31,067 INFO L93 Difference]: Finished difference Result 5670 states and 8267 transitions. [2019-01-14 15:16:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:16:31,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-14 15:16:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:31,073 INFO L225 Difference]: With dead ends: 5670 [2019-01-14 15:16:31,073 INFO L226 Difference]: Without dead ends: 3108 [2019-01-14 15:16:31,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-01-14 15:16:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2474. [2019-01-14 15:16:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-01-14 15:16:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3596 transitions. [2019-01-14 15:16:31,230 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3596 transitions. Word has length 228 [2019-01-14 15:16:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:31,230 INFO L480 AbstractCegarLoop]: Abstraction has 2474 states and 3596 transitions. [2019-01-14 15:16:31,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:16:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3596 transitions. [2019-01-14 15:16:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-01-14 15:16:31,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:31,233 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:31,234 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1542107582, now seen corresponding path program 1 times [2019-01-14 15:16:31,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:16:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:16:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:16:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 267 proven. 28 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-01-14 15:16:31,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:16:31,940 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 [2019-01-14 15:16:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:32,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:16:32,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 16 [2019-01-14 15:16:32,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2019-01-14 15:16:32,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-01-14 15:16:32,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 151 [2019-01-14 15:16:32,389 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 142 treesize of output 141 [2019-01-14 15:16:32,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,485 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 125 treesize of output 142 [2019-01-14 15:16:32,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 150 [2019-01-14 15:16:32,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 143 [2019-01-14 15:16:32,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 114 [2019-01-14 15:16:32,739 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,813 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 76 treesize of output 93 [2019-01-14 15:16:32,815 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-01-14 15:16:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 15:16:32,878 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,890 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:32,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 85 [2019-01-14 15:16:32,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:32,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,015 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 163 [2019-01-14 15:16:33,024 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2019-01-14 15:16:33,106 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:16:33,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:16:33,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 122 [2019-01-14 15:16:33,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,360 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 102 treesize of output 93 [2019-01-14 15:16:33,362 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2019-01-14 15:16:33,429 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 86 [2019-01-14 15:16:33,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,499 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:16:33,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,545 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 138 [2019-01-14 15:16:33,549 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2019-01-14 15:16:33,602 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:16:33,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-01-14 15:16:33,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 15:16:33,695 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,707 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,765 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 35 treesize of output 30 [2019-01-14 15:16:33,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:33,772 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,780 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,818 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:16:33,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:16:33,902 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 100 [2019-01-14 15:16:33,906 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 10 treesize of output 9 [2019-01-14 15:16:33,906 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2019-01-14 15:16:33,931 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:16:33,932 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 44 treesize of output 35 [2019-01-14 15:16:33,933 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2019-01-14 15:16:33,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:33,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2019-01-14 15:16:33,953 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,962 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,972 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,983 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:33,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 130 [2019-01-14 15:16:33,997 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 10 treesize of output 9 [2019-01-14 15:16:33,997 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 93 [2019-01-14 15:16:34,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2019-01-14 15:16:34,031 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,046 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 [2019-01-14 15:16:34,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:34,052 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,064 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,071 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,080 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 36 [2019-01-14 15:16:34,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2019-01-14 15:16:34,146 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,153 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 57 treesize of output 51 [2019-01-14 15:16:34,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 40 treesize of output 25 [2019-01-14 15:16:34,159 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,167 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 72 treesize of output 68 [2019-01-14 15:16:34,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 47 treesize of output 39 [2019-01-14 15:16:34,176 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,191 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 [2019-01-14 15:16:34,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2019-01-14 15:16:34,197 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,204 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 54 [2019-01-14 15:16:34,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 24 [2019-01-14 15:16:34,255 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,265 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:16:34,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 [2019-01-14 15:16:34,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 9 [2019-01-14 15:16:34,273 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,278 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 [2019-01-14 15:16:34,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 1 [2019-01-14 15:16:34,284 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,291 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 15:16:34,325 INFO L202 ElimStorePlain]: Needed 47 recursive calls to eliminate 3 variables, input treesize:169, output treesize:100 [2019-01-14 15:16:34,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 [2019-01-14 15:16:34,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 15:16:34,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-01-14 15:16:34,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 19 [2019-01-14 15:16:34,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2019-01-14 15:16:34,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:34,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 15:16:34,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:16:34,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:34,660 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:57, output treesize:1 [2019-01-14 15:16:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 117 proven. 51 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-01-14 15:16:34,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:16:34,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-01-14 15:16:34,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 15:16:34,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 15:16:34,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 15:16:34,723 INFO L87 Difference]: Start difference. First operand 2474 states and 3596 transitions. Second operand 8 states. [2019-01-14 15:16:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:36,684 INFO L93 Difference]: Finished difference Result 5734 states and 8324 transitions. [2019-01-14 15:16:36,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 15:16:36,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2019-01-14 15:16:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:36,687 INFO L225 Difference]: With dead ends: 5734 [2019-01-14 15:16:36,687 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:16:36,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:16:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:16:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:16:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:16:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:16:36,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2019-01-14 15:16:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:36,691 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:16:36,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 15:16:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:16:36,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:16:36,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:16:36,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:36,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:37,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:38,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:38,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:38,484 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 359 DAG size of output: 10 [2019-01-14 15:16:40,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:40,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:41,304 WARN L181 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 400 DAG size of output: 10 [2019-01-14 15:16:44,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:44,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:45,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:45,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:50,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:50,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:50,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:50,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:50,910 WARN L181 SmtUtils]: Spent 9.60 s on a formula simplification. DAG size of input: 849 DAG size of output: 10 [2019-01-14 15:16:57,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:57,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:57,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:16:57,660 WARN L181 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 705 DAG size of output: 10 [2019-01-14 15:17:26,070 WARN L181 SmtUtils]: Spent 28.40 s on a formula simplification. DAG size of input: 1019 DAG size of output: 412 [2019-01-14 15:17:32,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:32,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:32,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:32,693 WARN L181 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 705 DAG size of output: 10 [2019-01-14 15:17:36,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:36,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:36,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:36,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:36,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:41,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:41,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:41,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:41,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:41,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:45,850 WARN L181 SmtUtils]: Spent 13.15 s on a formula simplification. DAG size of input: 855 DAG size of output: 10 [2019-01-14 15:17:49,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:49,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:49,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:49,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:49,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:54,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:54,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:54,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:54,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:54,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:17:58,720 WARN L181 SmtUtils]: Spent 12.87 s on a formula simplification. DAG size of input: 855 DAG size of output: 10 [2019-01-14 15:18:05,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:05,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:05,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:05,372 WARN L181 SmtUtils]: Spent 6.65 s on a formula simplification. DAG size of input: 705 DAG size of output: 10 [2019-01-14 15:18:06,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:11,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:11,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:11,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:11,860 WARN L181 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 659 DAG size of output: 10 [2019-01-14 15:18:13,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:13,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:14,636 WARN L181 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 400 DAG size of output: 10 [2019-01-14 15:18:24,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:24,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:24,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:28,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:28,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:31,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:31,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:31,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:31,913 WARN L181 SmtUtils]: Spent 17.27 s on a formula simplification. DAG size of input: 954 DAG size of output: 10 [2019-01-14 15:18:33,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:33,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:37,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:38,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:18:39,192 WARN L181 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 780 DAG size of output: 10 [2019-01-14 15:18:46,761 WARN L181 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 404 DAG size of output: 1 [2019-01-14 15:18:46,782 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1535) no Hoare annotation was computed. [2019-01-14 15:18:46,782 INFO L448 ceAbstractionStarter]: For program point L1522-2(lines 1522 1535) no Hoare annotation was computed. [2019-01-14 15:18:46,782 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1295) no Hoare annotation was computed. [2019-01-14 15:18:46,782 INFO L444 ceAbstractionStarter]: At program point L1225(lines 1221 1575) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1291-2(lines 1235 1568) no Hoare annotation was computed. [2019-01-14 15:18:46,783 INFO L444 ceAbstractionStarter]: At program point L1159(lines 1155 1597) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1428) no Hoare annotation was computed. [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1391(lines 1391 1395) no Hoare annotation was computed. [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1391-2(lines 1235 1568) no Hoare annotation was computed. [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1259(lines 1259 1264) no Hoare annotation was computed. [2019-01-14 15:18:46,783 INFO L448 ceAbstractionStarter]: For program point L1491(lines 1491 1502) no Hoare annotation was computed. [2019-01-14 15:18:46,784 INFO L448 ceAbstractionStarter]: For program point L1491-1(lines 1491 1502) no Hoare annotation was computed. [2019-01-14 15:18:46,784 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1573) no Hoare annotation was computed. [2019-01-14 15:18:46,784 INFO L448 ceAbstractionStarter]: For program point L1194(lines 1194 1584) no Hoare annotation was computed. [2019-01-14 15:18:46,784 INFO L448 ceAbstractionStarter]: For program point L1161(lines 1161 1595) no Hoare annotation was computed. [2019-01-14 15:18:46,784 INFO L444 ceAbstractionStarter]: At program point L1228(lines 1227 1573) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,784 INFO L444 ceAbstractionStarter]: At program point L1195(lines 1185 1587) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,785 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1563) no Hoare annotation was computed. [2019-01-14 15:18:46,787 INFO L448 ceAbstractionStarter]: For program point L1526(lines 1526 1531) no Hoare annotation was computed. [2019-01-14 15:18:46,787 INFO L448 ceAbstractionStarter]: For program point L1493(lines 1493 1499) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1646) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1465) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1461-2(lines 1461 1465) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1230(lines 1230 1572) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1583) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1164(lines 1164 1594) no Hoare annotation was computed. [2019-01-14 15:18:46,788 INFO L448 ceAbstractionStarter]: For program point L1131-1(lines 1102 1647) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L451 ceAbstractionStarter]: At program point L1231(lines 1230 1572) the Hoare annotation is: true [2019-01-14 15:18:46,789 INFO L444 ceAbstractionStarter]: At program point L1165(lines 1161 1595) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1132(line 1132) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1430(lines 1430 1435) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1430-2(lines 1430 1435) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1331(lines 1331 1345) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1331-2(lines 1331 1345) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1370) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1582) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1167(lines 1167 1593) no Hoare annotation was computed. [2019-01-14 15:18:46,789 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1604) no Hoare annotation was computed. [2019-01-14 15:18:46,790 INFO L451 ceAbstractionStarter]: At program point L1234(lines 1233 1571) the Hoare annotation is: true [2019-01-14 15:18:46,795 INFO L444 ceAbstractionStarter]: At program point L1201(lines 1197 1583) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,795 INFO L451 ceAbstractionStarter]: At program point L1135(lines 1134 1604) the Hoare annotation is: true [2019-01-14 15:18:46,795 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1472) no Hoare annotation was computed. [2019-01-14 15:18:46,795 INFO L448 ceAbstractionStarter]: For program point L1401(lines 1401 1405) no Hoare annotation was computed. [2019-01-14 15:18:46,795 INFO L448 ceAbstractionStarter]: For program point L1335(lines 1335 1339) no Hoare annotation was computed. [2019-01-14 15:18:46,795 INFO L448 ceAbstractionStarter]: For program point L1401-2(lines 1401 1405) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1335-2(lines 1333 1345) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1581) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1170(lines 1170 1592) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1603) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1307) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L448 ceAbstractionStarter]: For program point L1270(lines 1270 1275) no Hoare annotation was computed. [2019-01-14 15:18:46,796 INFO L444 ceAbstractionStarter]: At program point L1171(lines 1167 1593) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,796 INFO L451 ceAbstractionStarter]: At program point L1569(lines 1235 1570) the Hoare annotation is: true [2019-01-14 15:18:46,798 INFO L448 ceAbstractionStarter]: For program point L1206(lines 1206 1580) no Hoare annotation was computed. [2019-01-14 15:18:46,798 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1591) no Hoare annotation was computed. [2019-01-14 15:18:46,798 INFO L448 ceAbstractionStarter]: For program point L1140(lines 1140 1602) no Hoare annotation was computed. [2019-01-14 15:18:46,798 INFO L451 ceAbstractionStarter]: At program point L1636(lines 1130 1637) the Hoare annotation is: true [2019-01-14 15:18:46,798 INFO L451 ceAbstractionStarter]: At program point L1240(lines 1137 1603) the Hoare annotation is: true [2019-01-14 15:18:46,798 INFO L444 ceAbstractionStarter]: At program point L1207(lines 1203 1581) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,798 INFO L451 ceAbstractionStarter]: At program point L1076(lines 1064 1078) the Hoare annotation is: true [2019-01-14 15:18:46,798 INFO L448 ceAbstractionStarter]: For program point L1605(lines 1605 1633) no Hoare annotation was computed. [2019-01-14 15:18:46,799 INFO L448 ceAbstractionStarter]: For program point L1605-1(lines 1605 1633) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1539(lines 1539 1543) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1539-2(lines 1539 1543) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 1579) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1176(lines 1176 1590) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1143(lines 1143 1601) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1630) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1474(lines 1474 1479) no Hoare annotation was computed. [2019-01-14 15:18:46,800 INFO L448 ceAbstractionStarter]: For program point L1441(lines 1441 1445) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1379) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L444 ceAbstractionStarter]: At program point L1177(lines 1173 1591) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1111(lines 1111 1119) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1644) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1607(lines 1607 1616) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1640-2(lines 1640 1644) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1607-2(lines 1606 1628) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1512) no Hoare annotation was computed. [2019-01-14 15:18:46,801 INFO L444 ceAbstractionStarter]: At program point L1376(lines 1102 1647) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,801 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1282) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L451 ceAbstractionStarter]: At program point L1079(lines 1079 1648) the Hoare annotation is: true [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1578) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1179(lines 1179 1589) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1245-2(lines 1245 1249) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1146(lines 1146 1600) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1613) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1312(lines 1312 1316) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1312-2(lines 1235 1568) no Hoare annotation was computed. [2019-01-14 15:18:46,802 INFO L444 ceAbstractionStarter]: At program point L1213(lines 1209 1579) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,802 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1114-2(lines 1111 1119) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1544(lines 1544 1548) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1544-2(lines 1544 1548) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1417) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1380(lines 1380 1384) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1215(lines 1215 1577) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1588) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1599) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1513(lines 1513 1517) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L448 ceAbstractionStarter]: For program point L1513-2(lines 1513 1517) no Hoare annotation was computed. [2019-01-14 15:18:46,803 INFO L444 ceAbstractionStarter]: At program point L1183(lines 1179 1589) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1255) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1576) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1185(lines 1185 1587) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1598) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L444 ceAbstractionStarter]: At program point L1219(lines 1215 1577) the Hoare annotation is: (not (= (select (select |#memory_int| ULTIMATE.start_ssl3_connect_~s.base) (+ ULTIMATE.start_ssl3_connect_~s.offset 52)) 4368)) [2019-01-14 15:18:46,804 INFO L451 ceAbstractionStarter]: At program point L1153(lines 1149 1599) the Hoare annotation is: true [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1484(lines 1484 1488) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1356) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1352-2(lines 1235 1568) no Hoare annotation was computed. [2019-01-14 15:18:46,804 INFO L448 ceAbstractionStarter]: For program point L1121(lines 1121 1129) no Hoare annotation was computed. [2019-01-14 15:18:46,805 INFO L448 ceAbstractionStarter]: For program point L1551(lines 1551 1555) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1551-2(lines 1551 1555) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1221(lines 1221 1575) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1188(lines 1188 1586) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1597) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1126) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1618(lines 1618 1624) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1453(lines 1453 1457) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1326) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1326) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1268) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1574) no Hoare annotation was computed. [2019-01-14 15:18:46,806 INFO L448 ceAbstractionStarter]: For program point L1191(lines 1191 1585) no Hoare annotation was computed. [2019-01-14 15:18:46,807 INFO L448 ceAbstractionStarter]: For program point L1257-2(lines 1257 1268) no Hoare annotation was computed. [2019-01-14 15:18:46,807 INFO L448 ceAbstractionStarter]: For program point L1158(lines 1158 1596) no Hoare annotation was computed. [2019-01-14 15:18:46,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:46,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:18:46 BoogieIcfgContainer [2019-01-14 15:18:46,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:18:46,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:18:46,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:18:46,865 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:18:46,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:14:53" (3/4) ... [2019-01-14 15:18:46,884 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:18:46,924 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 15:18:46,925 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:18:47,148 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:18:47,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:18:47,152 INFO L168 Benchmark]: Toolchain (without parser) took 236324.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.1 MB). Free memory was 947.3 MB in the beginning and 1.4 GB in the end (delta: -500.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,153 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-14 15:18:47,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1008.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,154 INFO L168 Benchmark]: Boogie Preprocessor took 96.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,154 INFO L168 Benchmark]: RCFGBuilder took 1912.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,154 INFO L168 Benchmark]: TraceAbstraction took 232893.03 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 387.4 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -458.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,161 INFO L168 Benchmark]: Witness Printer took 284.19 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:18:47,167 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.17 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 1008.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1912.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 232893.03 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 387.4 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -458.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 284.19 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1646]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1173]: Loop Invariant [2019-01-14 15:18:47,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1215]: Loop Invariant [2019-01-14 15:18:47,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1161]: Loop Invariant [2019-01-14 15:18:47,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1137]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1203]: Loop Invariant [2019-01-14 15:18:47,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1149]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1235]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1227]: Loop Invariant [2019-01-14 15:18:47,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1185]: Loop Invariant [2019-01-14 15:18:47,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1102]: Loop Invariant [2019-01-14 15:18:47,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1179]: Loop Invariant [2019-01-14 15:18:47,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1221]: Loop Invariant [2019-01-14 15:18:47,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1167]: Loop Invariant [2019-01-14 15:18:47,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1209]: Loop Invariant [2019-01-14 15:18:47,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1155]: Loop Invariant [2019-01-14 15:18:47,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1233]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1197]: Loop Invariant [2019-01-14 15:18:47,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:18:47,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: !(unknown-#memory_int-unknown[s][s + 52] == 4368) - InvariantResult [Line: 1134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1230]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. SAFE Result, 232.7s OverallTime, 93 OverallIterations, 11 TraceHistogramMax, 66.2s AutomataDifference, 0.0s DeadEndRemovalTime, 130.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20016 SDtfs, 7846 SDslu, 29440 SDs, 0 SdLazy, 19546 SolverSat, 883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1238 GetRequests, 759 SyntacticMatches, 167 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2658occurred in iteration=83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 93 MinimizatonAttempts, 27196 StatesRemovedByMinimization, 89 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 392 NumberOfFragments, 139 HoareAnnotationTreeSize, 22 FomulaSimplifications, -7901084742787300633 FormulaSimplificationTreeSizeReduction, 122.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 7439948515077103990 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 15475 NumberOfCodeBlocks, 15475 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 15379 ConstructedInterpolants, 16 QuantifiedInterpolants, 5690331 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2423 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 96 InterpolantComputations, 92 PerfectInterpolantSequences, 35190/35297 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...