./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer --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 e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer --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 e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:52:30,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:52:30,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:52:30,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:52:30,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:52:30,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:52:30,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:52:30,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:52:30,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:52:30,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:52:30,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:52:30,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:52:30,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:52:30,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:52:30,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:52:30,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:52:30,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:52:30,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:52:30,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:52:30,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:52:30,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:52:30,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:52:30,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:52:30,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:52:30,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:52:30,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:52:30,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:52:30,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:52:30,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:52:30,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:52:30,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:52:30,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:52:30,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:52:30,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:52:30,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:52:30,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:52:30,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:52:30,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:52:30,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:52:30,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:52:30,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:52:30,809 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:52:30,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:52:30,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:52:30,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:52:30,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:52:30,846 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:52:30,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:52:30,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:52:30,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:52:30,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:52:30,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:52:30,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:52:30,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:52:30,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:52:30,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:52:30,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:52:30,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:52:30,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:52:30,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:52:30,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:52:30,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:52:30,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:52:30,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:52:30,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:52:30,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:52:30,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:52:30,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:52:30,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:52:30,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:52:30,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer 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 -> e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 [2019-11-15 21:52:30,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:52:30,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:52:30,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:52:30,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:52:30,907 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:52:30,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:52:30,965 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b1b6b9c54/c124c04c4f3740af81d55445daa8ffb4/FLAG3d8593ea7 [2019-11-15 21:52:31,482 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:52:31,483 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:52:31,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b1b6b9c54/c124c04c4f3740af81d55445daa8ffb4/FLAG3d8593ea7 [2019-11-15 21:52:31,697 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b1b6b9c54/c124c04c4f3740af81d55445daa8ffb4 [2019-11-15 21:52:31,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:52:31,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:52:31,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:31,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:52:31,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:52:31,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:31" (1/1) ... [2019-11-15 21:52:31,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fef177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:31, skipping insertion in model container [2019-11-15 21:52:31,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:31" (1/1) ... [2019-11-15 21:52:31,713 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:52:31,792 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:52:32,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:32,294 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:52:32,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:32,483 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:52:32,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32 WrapperNode [2019-11-15 21:52:32,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:32,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:52:32,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:52:32,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:52:32,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:52:32,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:52:32,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:52:32,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:52:32,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... [2019-11-15 21:52:32,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:52:32,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:52:32,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:52:32,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:52:32,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/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-11-15 21:52:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:52:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:52:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:52:32,994 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:52:34,055 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:52:34,055 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:52:34,056 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:52:34,059 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:52:34,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:34 BoogieIcfgContainer [2019-11-15 21:52:34,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:52:34,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:52:34,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:52:34,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:52:34,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:52:31" (1/3) ... [2019-11-15 21:52:34,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67be5b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:34, skipping insertion in model container [2019-11-15 21:52:34,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:32" (2/3) ... [2019-11-15 21:52:34,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67be5b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:34, skipping insertion in model container [2019-11-15 21:52:34,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:34" (3/3) ... [2019-11-15 21:52:34,073 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:52:34,083 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:52:34,101 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:52:34,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:52:34,139 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:52:34,140 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:52:34,140 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:52:34,140 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:52:34,140 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:52:34,141 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:52:34,141 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:52:34,141 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:52:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 21:52:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:52:34,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:34,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:34,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1923572963, now seen corresponding path program 1 times [2019-11-15 21:52:34,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:34,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777002307] [2019-11-15 21:52:34,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:34,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:34,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777002307] [2019-11-15 21:52:34,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:34,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:34,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632500085] [2019-11-15 21:52:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:34,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:34,606 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-15 21:52:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:35,155 INFO L93 Difference]: Finished difference Result 331 states and 563 transitions. [2019-11-15 21:52:35,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:35,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-15 21:52:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:35,175 INFO L225 Difference]: With dead ends: 331 [2019-11-15 21:52:35,176 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 21:52:35,182 INFO L600 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-11-15 21:52:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 21:52:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-11-15 21:52:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2019-11-15 21:52:35,253 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 44 [2019-11-15 21:52:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:35,254 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2019-11-15 21:52:35,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2019-11-15 21:52:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:52:35,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:35,263 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:35,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1205735271, now seen corresponding path program 1 times [2019-11-15 21:52:35,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:35,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725140411] [2019-11-15 21:52:35,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:35,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:35,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:35,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725140411] [2019-11-15 21:52:35,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:35,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:35,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122337925] [2019-11-15 21:52:35,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:35,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:35,396 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand 4 states. [2019-11-15 21:52:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:35,768 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2019-11-15 21:52:35,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:35,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:52:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:35,771 INFO L225 Difference]: With dead ends: 298 [2019-11-15 21:52:35,771 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 21:52:35,772 INFO L600 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-11-15 21:52:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 21:52:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-11-15 21:52:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-11-15 21:52:35,796 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 57 [2019-11-15 21:52:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:35,797 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-11-15 21:52:35,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-11-15 21:52:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:52:35,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:35,807 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:52:35,807 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1990910741, now seen corresponding path program 1 times [2019-11-15 21:52:35,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:35,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827296373] [2019-11-15 21:52:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:35,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:35,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:35,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827296373] [2019-11-15 21:52:35,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:35,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:35,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896365527] [2019-11-15 21:52:35,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:35,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:35,940 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 4 states. [2019-11-15 21:52:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:36,322 INFO L93 Difference]: Finished difference Result 297 states and 457 transitions. [2019-11-15 21:52:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:36,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:52:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:36,326 INFO L225 Difference]: With dead ends: 297 [2019-11-15 21:52:36,326 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:52:36,327 INFO L600 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-11-15 21:52:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:52:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2019-11-15 21:52:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2019-11-15 21:52:36,349 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 58 [2019-11-15 21:52:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:36,350 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2019-11-15 21:52:36,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2019-11-15 21:52:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:52:36,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:36,352 INFO L380 BasicCegarLoop]: trace histogram [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-11-15 21:52:36,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2034239562, now seen corresponding path program 1 times [2019-11-15 21:52:36,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:36,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057760356] [2019-11-15 21:52:36,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:36,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:36,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:36,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057760356] [2019-11-15 21:52:36,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:36,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:36,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539403376] [2019-11-15 21:52:36,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:36,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:36,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:36,510 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand 4 states. [2019-11-15 21:52:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:36,833 INFO L93 Difference]: Finished difference Result 295 states and 454 transitions. [2019-11-15 21:52:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:36,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:52:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:36,836 INFO L225 Difference]: With dead ends: 295 [2019-11-15 21:52:36,836 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:52:36,837 INFO L600 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-11-15 21:52:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:52:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2019-11-15 21:52:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-11-15 21:52:36,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 58 [2019-11-15 21:52:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:36,859 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-11-15 21:52:36,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-11-15 21:52:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:52:36,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:36,862 INFO L380 BasicCegarLoop]: trace histogram [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-11-15 21:52:36,862 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:36,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:36,862 INFO L82 PathProgramCache]: Analyzing trace with hash -290440950, now seen corresponding path program 1 times [2019-11-15 21:52:36,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:36,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654121282] [2019-11-15 21:52:36,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:36,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:36,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:36,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654121282] [2019-11-15 21:52:36,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:36,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:36,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575579313] [2019-11-15 21:52:36,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:36,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:36,986 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 4 states. [2019-11-15 21:52:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:37,277 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2019-11-15 21:52:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:37,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:52:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:37,279 INFO L225 Difference]: With dead ends: 294 [2019-11-15 21:52:37,279 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:52:37,280 INFO L600 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-11-15 21:52:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:52:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-15 21:52:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 230 transitions. [2019-11-15 21:52:37,292 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 230 transitions. Word has length 58 [2019-11-15 21:52:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 230 transitions. [2019-11-15 21:52:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 230 transitions. [2019-11-15 21:52:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:52:37,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:37,293 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:52:37,294 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 355375361, now seen corresponding path program 1 times [2019-11-15 21:52:37,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:37,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965628795] [2019-11-15 21:52:37,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:37,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:37,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:37,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965628795] [2019-11-15 21:52:37,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:37,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:37,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651282312] [2019-11-15 21:52:37,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:37,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:37,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:37,359 INFO L87 Difference]: Start difference. First operand 150 states and 230 transitions. Second operand 4 states. [2019-11-15 21:52:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:37,660 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2019-11-15 21:52:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:37,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:52:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:37,665 INFO L225 Difference]: With dead ends: 294 [2019-11-15 21:52:37,665 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:52:37,665 INFO L600 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-11-15 21:52:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:52:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-15 21:52:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2019-11-15 21:52:37,672 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 58 [2019-11-15 21:52:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:37,676 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2019-11-15 21:52:37,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2019-11-15 21:52:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:52:37,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:37,681 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:52:37,681 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1368481214, now seen corresponding path program 1 times [2019-11-15 21:52:37,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:37,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606543682] [2019-11-15 21:52:37,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:37,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:37,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:37,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606543682] [2019-11-15 21:52:37,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:37,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:37,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125165046] [2019-11-15 21:52:37,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:37,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:37,778 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand 4 states. [2019-11-15 21:52:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:38,106 INFO L93 Difference]: Finished difference Result 294 states and 450 transitions. [2019-11-15 21:52:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:38,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:52:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:38,109 INFO L225 Difference]: With dead ends: 294 [2019-11-15 21:52:38,109 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:52:38,109 INFO L600 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-11-15 21:52:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:52:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-15 21:52:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 228 transitions. [2019-11-15 21:52:38,120 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 228 transitions. Word has length 59 [2019-11-15 21:52:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 228 transitions. [2019-11-15 21:52:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 228 transitions. [2019-11-15 21:52:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:52:38,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:38,122 INFO L380 BasicCegarLoop]: trace histogram [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-11-15 21:52:38,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1032037892, now seen corresponding path program 1 times [2019-11-15 21:52:38,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:38,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130785303] [2019-11-15 21:52:38,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:38,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130785303] [2019-11-15 21:52:38,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:38,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:38,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698895501] [2019-11-15 21:52:38,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:38,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:38,231 INFO L87 Difference]: Start difference. First operand 150 states and 228 transitions. Second operand 4 states. [2019-11-15 21:52:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:38,578 INFO L93 Difference]: Finished difference Result 294 states and 449 transitions. [2019-11-15 21:52:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:38,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:52:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:38,580 INFO L225 Difference]: With dead ends: 294 [2019-11-15 21:52:38,580 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:52:38,581 INFO L600 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-11-15 21:52:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:52:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-15 21:52:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2019-11-15 21:52:38,587 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 60 [2019-11-15 21:52:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:38,587 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2019-11-15 21:52:38,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2019-11-15 21:52:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:52:38,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:38,589 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:52:38,589 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1880748327, now seen corresponding path program 1 times [2019-11-15 21:52:38,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:38,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841669352] [2019-11-15 21:52:38,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:38,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841669352] [2019-11-15 21:52:38,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:38,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:38,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294093860] [2019-11-15 21:52:38,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:38,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:38,682 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand 4 states. [2019-11-15 21:52:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:38,995 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2019-11-15 21:52:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:38,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 21:52:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:38,997 INFO L225 Difference]: With dead ends: 284 [2019-11-15 21:52:38,997 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:52:38,998 INFO L600 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-11-15 21:52:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:52:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2019-11-15 21:52:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:52:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2019-11-15 21:52:39,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 61 [2019-11-15 21:52:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:39,004 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2019-11-15 21:52:39,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2019-11-15 21:52:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:52:39,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:39,005 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:52:39,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 626011761, now seen corresponding path program 1 times [2019-11-15 21:52:39,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:39,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310850214] [2019-11-15 21:52:39,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:39,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310850214] [2019-11-15 21:52:39,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:39,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:39,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374822782] [2019-11-15 21:52:39,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:39,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:39,062 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand 4 states. [2019-11-15 21:52:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:39,462 INFO L93 Difference]: Finished difference Result 324 states and 496 transitions. [2019-11-15 21:52:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:39,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 21:52:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:39,464 INFO L225 Difference]: With dead ends: 324 [2019-11-15 21:52:39,465 INFO L226 Difference]: Without dead ends: 193 [2019-11-15 21:52:39,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-15 21:52:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2019-11-15 21:52:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2019-11-15 21:52:39,472 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 61 [2019-11-15 21:52:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:39,473 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2019-11-15 21:52:39,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2019-11-15 21:52:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:52:39,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:39,474 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-15 21:52:39,475 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1836467047, now seen corresponding path program 1 times [2019-11-15 21:52:39,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:39,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311832944] [2019-11-15 21:52:39,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:39,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311832944] [2019-11-15 21:52:39,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:39,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:39,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632584344] [2019-11-15 21:52:39,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:39,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:39,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:39,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:39,535 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand 4 states. [2019-11-15 21:52:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:39,901 INFO L93 Difference]: Finished difference Result 346 states and 533 transitions. [2019-11-15 21:52:39,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:39,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:52:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:39,903 INFO L225 Difference]: With dead ends: 346 [2019-11-15 21:52:39,903 INFO L226 Difference]: Without dead ends: 193 [2019-11-15 21:52:39,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-15 21:52:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2019-11-15 21:52:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 263 transitions. [2019-11-15 21:52:39,909 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 263 transitions. Word has length 74 [2019-11-15 21:52:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:39,909 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 263 transitions. [2019-11-15 21:52:39,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2019-11-15 21:52:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:52:39,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:39,911 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:39,911 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2123047901, now seen corresponding path program 1 times [2019-11-15 21:52:39,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:39,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283948903] [2019-11-15 21:52:39,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:39,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283948903] [2019-11-15 21:52:39,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:39,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:39,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11429514] [2019-11-15 21:52:39,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:39,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:39,958 INFO L87 Difference]: Start difference. First operand 172 states and 263 transitions. Second operand 4 states. [2019-11-15 21:52:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:40,315 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2019-11-15 21:52:40,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:40,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:52:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:40,317 INFO L225 Difference]: With dead ends: 345 [2019-11-15 21:52:40,317 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 21:52:40,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 21:52:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2019-11-15 21:52:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2019-11-15 21:52:40,324 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 75 [2019-11-15 21:52:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:40,325 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2019-11-15 21:52:40,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2019-11-15 21:52:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:52:40,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:40,326 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:40,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2079719080, now seen corresponding path program 1 times [2019-11-15 21:52:40,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:40,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432097103] [2019-11-15 21:52:40,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:40,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:40,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:40,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432097103] [2019-11-15 21:52:40,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:40,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:40,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163804886] [2019-11-15 21:52:40,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:40,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:40,389 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand 4 states. [2019-11-15 21:52:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:40,778 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-15 21:52:40,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:40,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:52:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:40,781 INFO L225 Difference]: With dead ends: 343 [2019-11-15 21:52:40,781 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 21:52:40,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 21:52:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2019-11-15 21:52:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2019-11-15 21:52:40,789 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 75 [2019-11-15 21:52:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:40,791 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2019-11-15 21:52:40,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2019-11-15 21:52:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:52:40,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:40,793 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-15 21:52:40,793 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash -109432296, now seen corresponding path program 1 times [2019-11-15 21:52:40,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:40,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975060491] [2019-11-15 21:52:40,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:40,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:40,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975060491] [2019-11-15 21:52:40,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:40,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:40,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652879964] [2019-11-15 21:52:40,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:40,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:40,874 INFO L87 Difference]: Start difference. First operand 172 states and 261 transitions. Second operand 4 states. [2019-11-15 21:52:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:41,276 INFO L93 Difference]: Finished difference Result 342 states and 523 transitions. [2019-11-15 21:52:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:41,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:52:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:41,278 INFO L225 Difference]: With dead ends: 342 [2019-11-15 21:52:41,278 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:52:41,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:52:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-15 21:52:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 260 transitions. [2019-11-15 21:52:41,287 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 260 transitions. Word has length 75 [2019-11-15 21:52:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:41,287 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 260 transitions. [2019-11-15 21:52:41,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 260 transitions. [2019-11-15 21:52:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:52:41,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:41,289 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-15 21:52:41,289 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 536384015, now seen corresponding path program 1 times [2019-11-15 21:52:41,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:41,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844981772] [2019-11-15 21:52:41,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:41,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:41,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:41,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844981772] [2019-11-15 21:52:41,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:41,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:41,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935845807] [2019-11-15 21:52:41,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:41,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:41,344 INFO L87 Difference]: Start difference. First operand 172 states and 260 transitions. Second operand 4 states. [2019-11-15 21:52:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:41,723 INFO L93 Difference]: Finished difference Result 342 states and 521 transitions. [2019-11-15 21:52:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:41,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:52:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:41,725 INFO L225 Difference]: With dead ends: 342 [2019-11-15 21:52:41,726 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:52:41,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:52:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-15 21:52:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 259 transitions. [2019-11-15 21:52:41,735 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 259 transitions. Word has length 75 [2019-11-15 21:52:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:41,735 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 259 transitions. [2019-11-15 21:52:41,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 259 transitions. [2019-11-15 21:52:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:52:41,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:41,737 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2019-11-15 21:52:41,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1610185104, now seen corresponding path program 1 times [2019-11-15 21:52:41,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:41,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359828341] [2019-11-15 21:52:41,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:41,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:41,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:41,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359828341] [2019-11-15 21:52:41,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:41,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:41,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486613977] [2019-11-15 21:52:41,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:41,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:41,800 INFO L87 Difference]: Start difference. First operand 172 states and 259 transitions. Second operand 4 states. [2019-11-15 21:52:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:42,168 INFO L93 Difference]: Finished difference Result 342 states and 519 transitions. [2019-11-15 21:52:42,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:42,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 21:52:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:42,170 INFO L225 Difference]: With dead ends: 342 [2019-11-15 21:52:42,170 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:52:42,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:52:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-15 21:52:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 258 transitions. [2019-11-15 21:52:42,179 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 258 transitions. Word has length 76 [2019-11-15 21:52:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:42,180 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 258 transitions. [2019-11-15 21:52:42,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 258 transitions. [2019-11-15 21:52:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:52:42,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:42,181 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2019-11-15 21:52:42,181 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1118586762, now seen corresponding path program 1 times [2019-11-15 21:52:42,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:42,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95850401] [2019-11-15 21:52:42,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:42,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95850401] [2019-11-15 21:52:42,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:42,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:42,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079915221] [2019-11-15 21:52:42,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:42,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:42,234 INFO L87 Difference]: Start difference. First operand 172 states and 258 transitions. Second operand 4 states. [2019-11-15 21:52:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:42,568 INFO L93 Difference]: Finished difference Result 342 states and 517 transitions. [2019-11-15 21:52:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:42,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 21:52:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:42,570 INFO L225 Difference]: With dead ends: 342 [2019-11-15 21:52:42,570 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:52:42,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:52:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-15 21:52:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-11-15 21:52:42,576 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 77 [2019-11-15 21:52:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-11-15 21:52:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-11-15 21:52:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 21:52:42,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:42,579 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:42,579 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash 364106507, now seen corresponding path program 1 times [2019-11-15 21:52:42,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:42,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219987477] [2019-11-15 21:52:42,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:42,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219987477] [2019-11-15 21:52:42,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:42,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:42,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361354862] [2019-11-15 21:52:42,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:42,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:42,640 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-11-15 21:52:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:42,956 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2019-11-15 21:52:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:42,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 21:52:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:42,958 INFO L225 Difference]: With dead ends: 332 [2019-11-15 21:52:42,958 INFO L226 Difference]: Without dead ends: 179 [2019-11-15 21:52:42,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-15 21:52:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2019-11-15 21:52:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:52:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-11-15 21:52:42,964 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 78 [2019-11-15 21:52:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:42,964 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-11-15 21:52:42,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-11-15 21:52:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 21:52:42,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:42,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-15 21:52:42,965 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1853928521, now seen corresponding path program 1 times [2019-11-15 21:52:42,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:42,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437379420] [2019-11-15 21:52:42,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:43,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437379420] [2019-11-15 21:52:43,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:43,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:43,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686939426] [2019-11-15 21:52:43,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:43,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:43,048 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-11-15 21:52:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:43,541 INFO L93 Difference]: Finished difference Result 435 states and 661 transitions. [2019-11-15 21:52:43,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:43,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-15 21:52:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:43,547 INFO L225 Difference]: With dead ends: 435 [2019-11-15 21:52:43,547 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 21:52:43,547 INFO L600 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-11-15 21:52:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 21:52:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 213. [2019-11-15 21:52:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 21:52:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2019-11-15 21:52:43,581 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 83 [2019-11-15 21:52:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:43,581 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2019-11-15 21:52:43,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2019-11-15 21:52:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 21:52:43,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:43,583 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-15 21:52:43,583 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2102075015, now seen corresponding path program 1 times [2019-11-15 21:52:43,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:43,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555973773] [2019-11-15 21:52:43,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:43,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:43,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:43,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555973773] [2019-11-15 21:52:43,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:43,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:43,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548128781] [2019-11-15 21:52:43,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:43,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:43,650 INFO L87 Difference]: Start difference. First operand 213 states and 330 transitions. Second operand 4 states. [2019-11-15 21:52:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:44,027 INFO L93 Difference]: Finished difference Result 456 states and 713 transitions. [2019-11-15 21:52:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:44,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-15 21:52:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:44,030 INFO L225 Difference]: With dead ends: 456 [2019-11-15 21:52:44,030 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 21:52:44,030 INFO L600 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-11-15 21:52:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 21:52:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-11-15 21:52:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:52:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 372 transitions. [2019-11-15 21:52:44,038 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 372 transitions. Word has length 83 [2019-11-15 21:52:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:44,038 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 372 transitions. [2019-11-15 21:52:44,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 372 transitions. [2019-11-15 21:52:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 21:52:44,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:44,040 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-15 21:52:44,040 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 399512031, now seen corresponding path program 1 times [2019-11-15 21:52:44,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:44,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113010810] [2019-11-15 21:52:44,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:44,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:44,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:44,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113010810] [2019-11-15 21:52:44,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:44,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:44,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991363689] [2019-11-15 21:52:44,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:44,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:44,118 INFO L87 Difference]: Start difference. First operand 237 states and 372 transitions. Second operand 4 states. [2019-11-15 21:52:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:44,590 INFO L93 Difference]: Finished difference Result 515 states and 805 transitions. [2019-11-15 21:52:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:44,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 21:52:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:44,592 INFO L225 Difference]: With dead ends: 515 [2019-11-15 21:52:44,592 INFO L226 Difference]: Without dead ends: 297 [2019-11-15 21:52:44,593 INFO L600 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-11-15 21:52:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-15 21:52:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 238. [2019-11-15 21:52:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 373 transitions. [2019-11-15 21:52:44,599 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 373 transitions. Word has length 84 [2019-11-15 21:52:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:44,600 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 373 transitions. [2019-11-15 21:52:44,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 373 transitions. [2019-11-15 21:52:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:52:44,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:44,602 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:44,602 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478015, now seen corresponding path program 1 times [2019-11-15 21:52:44,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:44,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458381061] [2019-11-15 21:52:44,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:44,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:44,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:44,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458381061] [2019-11-15 21:52:44,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:44,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:44,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726655640] [2019-11-15 21:52:44,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:44,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:44,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:44,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:44,674 INFO L87 Difference]: Start difference. First operand 238 states and 373 transitions. Second operand 4 states. [2019-11-15 21:52:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:45,131 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2019-11-15 21:52:45,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:45,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:52:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:45,133 INFO L225 Difference]: With dead ends: 516 [2019-11-15 21:52:45,133 INFO L226 Difference]: Without dead ends: 297 [2019-11-15 21:52:45,134 INFO L600 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-11-15 21:52:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-15 21:52:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 238. [2019-11-15 21:52:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 372 transitions. [2019-11-15 21:52:45,141 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 372 transitions. Word has length 96 [2019-11-15 21:52:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:45,141 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 372 transitions. [2019-11-15 21:52:45,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 372 transitions. [2019-11-15 21:52:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:52:45,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:45,142 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:45,142 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash -689692605, now seen corresponding path program 1 times [2019-11-15 21:52:45,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:45,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924615828] [2019-11-15 21:52:45,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:45,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:45,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:45,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924615828] [2019-11-15 21:52:45,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:45,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:45,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441269018] [2019-11-15 21:52:45,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:45,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:45,202 INFO L87 Difference]: Start difference. First operand 238 states and 372 transitions. Second operand 4 states. [2019-11-15 21:52:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:45,595 INFO L93 Difference]: Finished difference Result 482 states and 754 transitions. [2019-11-15 21:52:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:45,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:52:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:45,598 INFO L225 Difference]: With dead ends: 482 [2019-11-15 21:52:45,598 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 21:52:45,598 INFO L600 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-11-15 21:52:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 21:52:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 238. [2019-11-15 21:52:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2019-11-15 21:52:45,605 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 96 [2019-11-15 21:52:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:45,606 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2019-11-15 21:52:45,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2019-11-15 21:52:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:45,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:45,607 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:45,607 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash -973453317, now seen corresponding path program 1 times [2019-11-15 21:52:45,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:45,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101217019] [2019-11-15 21:52:45,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:45,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:45,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101217019] [2019-11-15 21:52:45,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:45,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:45,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803425484] [2019-11-15 21:52:45,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:45,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:45,667 INFO L87 Difference]: Start difference. First operand 238 states and 371 transitions. Second operand 4 states. [2019-11-15 21:52:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:46,118 INFO L93 Difference]: Finished difference Result 515 states and 800 transitions. [2019-11-15 21:52:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:46,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:52:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:46,120 INFO L225 Difference]: With dead ends: 515 [2019-11-15 21:52:46,120 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 21:52:46,121 INFO L600 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-11-15 21:52:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 21:52:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 238. [2019-11-15 21:52:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 370 transitions. [2019-11-15 21:52:46,130 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 370 transitions. Word has length 97 [2019-11-15 21:52:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:46,130 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 370 transitions. [2019-11-15 21:52:46,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 370 transitions. [2019-11-15 21:52:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:46,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:46,132 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-15 21:52:46,132 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -930124496, now seen corresponding path program 1 times [2019-11-15 21:52:46,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:46,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670530582] [2019-11-15 21:52:46,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:46,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670530582] [2019-11-15 21:52:46,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:46,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:46,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629005713] [2019-11-15 21:52:46,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:46,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:46,197 INFO L87 Difference]: Start difference. First operand 238 states and 370 transitions. Second operand 4 states. [2019-11-15 21:52:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:46,628 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-15 21:52:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:46,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:52:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:46,630 INFO L225 Difference]: With dead ends: 513 [2019-11-15 21:52:46,630 INFO L226 Difference]: Without dead ends: 294 [2019-11-15 21:52:46,630 INFO L600 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-11-15 21:52:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-15 21:52:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 238. [2019-11-15 21:52:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-11-15 21:52:46,639 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 97 [2019-11-15 21:52:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:46,640 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-11-15 21:52:46,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-11-15 21:52:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:46,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:46,641 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 21:52:46,642 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:46,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1040162288, now seen corresponding path program 1 times [2019-11-15 21:52:46,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:46,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616946699] [2019-11-15 21:52:46,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:46,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616946699] [2019-11-15 21:52:46,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:46,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:46,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748436898] [2019-11-15 21:52:46,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:46,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:46,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:46,743 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 4 states. [2019-11-15 21:52:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:47,176 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2019-11-15 21:52:47,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:47,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:52:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:47,178 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:52:47,178 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 21:52:47,179 INFO L600 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-11-15 21:52:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 21:52:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 238. [2019-11-15 21:52:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-15 21:52:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2019-11-15 21:52:47,185 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 97 [2019-11-15 21:52:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:47,185 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2019-11-15 21:52:47,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2019-11-15 21:52:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:47,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:47,187 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:47,187 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1685978599, now seen corresponding path program 1 times [2019-11-15 21:52:47,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:47,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897921307] [2019-11-15 21:52:47,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:47,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:47,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:52:47,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897921307] [2019-11-15 21:52:47,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:47,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:52:47,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167156636] [2019-11-15 21:52:47,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:52:47,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:47,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:52:47,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:47,261 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand 5 states. [2019-11-15 21:52:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:47,704 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2019-11-15 21:52:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:47,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-15 21:52:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:47,706 INFO L225 Difference]: With dead ends: 478 [2019-11-15 21:52:47,706 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 21:52:47,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 21:52:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2019-11-15 21:52:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2019-11-15 21:52:47,713 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 97 [2019-11-15 21:52:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:47,714 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2019-11-15 21:52:47,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:52:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2019-11-15 21:52:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:47,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:47,715 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-15 21:52:47,715 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash -889449746, now seen corresponding path program 1 times [2019-11-15 21:52:47,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:47,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650505982] [2019-11-15 21:52:47,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:47,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:47,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650505982] [2019-11-15 21:52:47,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:47,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:47,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257613449] [2019-11-15 21:52:47,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:47,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:47,780 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand 4 states. [2019-11-15 21:52:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:48,146 INFO L93 Difference]: Finished difference Result 519 states and 794 transitions. [2019-11-15 21:52:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:48,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:52:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:48,148 INFO L225 Difference]: With dead ends: 519 [2019-11-15 21:52:48,148 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 21:52:48,149 INFO L600 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-11-15 21:52:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 21:52:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 258. [2019-11-15 21:52:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 393 transitions. [2019-11-15 21:52:48,156 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 393 transitions. Word has length 97 [2019-11-15 21:52:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:48,156 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 393 transitions. [2019-11-15 21:52:48,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 393 transitions. [2019-11-15 21:52:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:52:48,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:48,158 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 21:52:48,158 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1080837038, now seen corresponding path program 1 times [2019-11-15 21:52:48,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:48,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753697490] [2019-11-15 21:52:48,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:48,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753697490] [2019-11-15 21:52:48,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:48,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:48,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028895639] [2019-11-15 21:52:48,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:48,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:48,215 INFO L87 Difference]: Start difference. First operand 258 states and 393 transitions. Second operand 4 states. [2019-11-15 21:52:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:48,541 INFO L93 Difference]: Finished difference Result 518 states and 791 transitions. [2019-11-15 21:52:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:48,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:52:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:48,543 INFO L225 Difference]: With dead ends: 518 [2019-11-15 21:52:48,543 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:52:48,544 INFO L600 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-11-15 21:52:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:52:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-15 21:52:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 392 transitions. [2019-11-15 21:52:48,550 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 392 transitions. Word has length 97 [2019-11-15 21:52:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:48,550 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 392 transitions. [2019-11-15 21:52:48,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 392 transitions. [2019-11-15 21:52:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:52:48,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:48,552 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:48,552 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1274184123, now seen corresponding path program 1 times [2019-11-15 21:52:48,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:48,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445604547] [2019-11-15 21:52:48,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:48,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445604547] [2019-11-15 21:52:48,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:48,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:48,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929376809] [2019-11-15 21:52:48,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:48,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:48,610 INFO L87 Difference]: Start difference. First operand 258 states and 392 transitions. Second operand 4 states. [2019-11-15 21:52:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:49,014 INFO L93 Difference]: Finished difference Result 552 states and 838 transitions. [2019-11-15 21:52:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:49,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:52:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:49,016 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:52:49,017 INFO L226 Difference]: Without dead ends: 313 [2019-11-15 21:52:49,017 INFO L600 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-11-15 21:52:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-15 21:52:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-15 21:52:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 391 transitions. [2019-11-15 21:52:49,026 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 391 transitions. Word has length 98 [2019-11-15 21:52:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:49,027 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 391 transitions. [2019-11-15 21:52:49,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 391 transitions. [2019-11-15 21:52:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:52:49,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:49,028 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:49,028 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash -13266873, now seen corresponding path program 1 times [2019-11-15 21:52:49,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:49,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555214566] [2019-11-15 21:52:49,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:49,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555214566] [2019-11-15 21:52:49,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:49,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:49,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453614307] [2019-11-15 21:52:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:49,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:49,084 INFO L87 Difference]: Start difference. First operand 258 states and 391 transitions. Second operand 4 states. [2019-11-15 21:52:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:49,355 INFO L93 Difference]: Finished difference Result 518 states and 787 transitions. [2019-11-15 21:52:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:49,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:52:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:49,357 INFO L225 Difference]: With dead ends: 518 [2019-11-15 21:52:49,357 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:52:49,358 INFO L600 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-11-15 21:52:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:52:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-15 21:52:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 390 transitions. [2019-11-15 21:52:49,364 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 390 transitions. Word has length 98 [2019-11-15 21:52:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:49,365 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 390 transitions. [2019-11-15 21:52:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 390 transitions. [2019-11-15 21:52:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:52:49,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:49,366 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:49,366 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 577756340, now seen corresponding path program 1 times [2019-11-15 21:52:49,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:49,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391296443] [2019-11-15 21:52:49,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:49,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391296443] [2019-11-15 21:52:49,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:49,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:49,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834895415] [2019-11-15 21:52:49,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:49,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:49,435 INFO L87 Difference]: Start difference. First operand 258 states and 390 transitions. Second operand 4 states. [2019-11-15 21:52:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:49,777 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2019-11-15 21:52:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:49,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:52:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:49,779 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:52:49,779 INFO L226 Difference]: Without dead ends: 313 [2019-11-15 21:52:49,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-15 21:52:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-15 21:52:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2019-11-15 21:52:49,789 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 99 [2019-11-15 21:52:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2019-11-15 21:52:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2019-11-15 21:52:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:52:49,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:49,790 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:49,791 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:49,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1011485426, now seen corresponding path program 1 times [2019-11-15 21:52:49,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:49,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85336855] [2019-11-15 21:52:49,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:49,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85336855] [2019-11-15 21:52:49,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:49,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:49,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483824678] [2019-11-15 21:52:49,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:49,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:49,866 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand 4 states. [2019-11-15 21:52:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:50,176 INFO L93 Difference]: Finished difference Result 518 states and 783 transitions. [2019-11-15 21:52:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:50,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:52:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:50,178 INFO L225 Difference]: With dead ends: 518 [2019-11-15 21:52:50,179 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:52:50,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:52:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-15 21:52:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 388 transitions. [2019-11-15 21:52:50,186 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 388 transitions. Word has length 99 [2019-11-15 21:52:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:50,186 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 388 transitions. [2019-11-15 21:52:50,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 388 transitions. [2019-11-15 21:52:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:52:50,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:50,187 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:50,187 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2114539050, now seen corresponding path program 1 times [2019-11-15 21:52:50,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:50,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851764433] [2019-11-15 21:52:50,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:50,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:50,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:50,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851764433] [2019-11-15 21:52:50,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:50,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:50,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120879573] [2019-11-15 21:52:50,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:50,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:50,239 INFO L87 Difference]: Start difference. First operand 258 states and 388 transitions. Second operand 4 states. [2019-11-15 21:52:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:50,627 INFO L93 Difference]: Finished difference Result 552 states and 830 transitions. [2019-11-15 21:52:50,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:50,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 21:52:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:50,629 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:52:50,629 INFO L226 Difference]: Without dead ends: 313 [2019-11-15 21:52:50,629 INFO L600 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-11-15 21:52:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-15 21:52:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-15 21:52:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 387 transitions. [2019-11-15 21:52:50,636 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 387 transitions. Word has length 100 [2019-11-15 21:52:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:50,636 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 387 transitions. [2019-11-15 21:52:50,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 387 transitions. [2019-11-15 21:52:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:52:50,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:50,638 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:50,638 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1619728468, now seen corresponding path program 1 times [2019-11-15 21:52:50,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:50,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720698533] [2019-11-15 21:52:50,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:50,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:50,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720698533] [2019-11-15 21:52:50,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:50,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:50,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360315029] [2019-11-15 21:52:50,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:50,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:50,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:50,698 INFO L87 Difference]: Start difference. First operand 258 states and 387 transitions. Second operand 4 states. [2019-11-15 21:52:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:51,001 INFO L93 Difference]: Finished difference Result 518 states and 779 transitions. [2019-11-15 21:52:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:51,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 21:52:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:51,004 INFO L225 Difference]: With dead ends: 518 [2019-11-15 21:52:51,004 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:52:51,005 INFO L600 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-11-15 21:52:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:52:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-15 21:52:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 386 transitions. [2019-11-15 21:52:51,010 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 386 transitions. Word has length 100 [2019-11-15 21:52:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:51,011 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 386 transitions. [2019-11-15 21:52:51,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 386 transitions. [2019-11-15 21:52:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:52:51,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:51,012 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:51,012 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1823601287, now seen corresponding path program 1 times [2019-11-15 21:52:51,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:51,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633124921] [2019-11-15 21:52:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:51,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633124921] [2019-11-15 21:52:51,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:51,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:51,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193936060] [2019-11-15 21:52:51,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:51,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:51,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:51,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:51,078 INFO L87 Difference]: Start difference. First operand 258 states and 386 transitions. Second operand 4 states. [2019-11-15 21:52:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:51,404 INFO L93 Difference]: Finished difference Result 542 states and 814 transitions. [2019-11-15 21:52:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:51,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 21:52:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:51,406 INFO L225 Difference]: With dead ends: 542 [2019-11-15 21:52:51,406 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 21:52:51,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 21:52:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 258. [2019-11-15 21:52:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 385 transitions. [2019-11-15 21:52:51,414 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 385 transitions. Word has length 101 [2019-11-15 21:52:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:51,414 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 385 transitions. [2019-11-15 21:52:51,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-11-15 21:52:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:52:51,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:51,415 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:51,416 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1621777353, now seen corresponding path program 1 times [2019-11-15 21:52:51,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:51,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111663855] [2019-11-15 21:52:51,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:51,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111663855] [2019-11-15 21:52:51,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:51,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:51,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223091031] [2019-11-15 21:52:51,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:51,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:51,493 INFO L87 Difference]: Start difference. First operand 258 states and 385 transitions. Second operand 4 states. [2019-11-15 21:52:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:51,758 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2019-11-15 21:52:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:51,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 21:52:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:51,761 INFO L225 Difference]: With dead ends: 508 [2019-11-15 21:52:51,761 INFO L226 Difference]: Without dead ends: 269 [2019-11-15 21:52:51,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-15 21:52:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2019-11-15 21:52:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-11-15 21:52:51,771 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 101 [2019-11-15 21:52:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:51,771 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-11-15 21:52:51,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-11-15 21:52:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:52:51,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:51,773 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:51,773 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1479826643, now seen corresponding path program 1 times [2019-11-15 21:52:51,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:51,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505462403] [2019-11-15 21:52:51,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:51,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:52:51,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505462403] [2019-11-15 21:52:51,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:51,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:51,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031312664] [2019-11-15 21:52:51,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:51,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:51,844 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 4 states. [2019-11-15 21:52:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:52,327 INFO L93 Difference]: Finished difference Result 542 states and 810 transitions. [2019-11-15 21:52:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:52,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-15 21:52:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:52,330 INFO L225 Difference]: With dead ends: 542 [2019-11-15 21:52:52,330 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 21:52:52,330 INFO L600 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-11-15 21:52:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 21:52:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 258. [2019-11-15 21:52:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 21:52:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 383 transitions. [2019-11-15 21:52:52,338 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 383 transitions. Word has length 105 [2019-11-15 21:52:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:52,338 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 383 transitions. [2019-11-15 21:52:52,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 383 transitions. [2019-11-15 21:52:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:52:52,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:52,340 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:52,340 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1534219541, now seen corresponding path program 1 times [2019-11-15 21:52:52,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:52,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283288023] [2019-11-15 21:52:52,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 21:52:52,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283288023] [2019-11-15 21:52:52,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:52,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:52,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959683652] [2019-11-15 21:52:52,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:52,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:52,403 INFO L87 Difference]: Start difference. First operand 258 states and 383 transitions. Second operand 3 states. [2019-11-15 21:52:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:52,473 INFO L93 Difference]: Finished difference Result 734 states and 1104 transitions. [2019-11-15 21:52:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:52,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 21:52:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:52,477 INFO L225 Difference]: With dead ends: 734 [2019-11-15 21:52:52,477 INFO L226 Difference]: Without dead ends: 495 [2019-11-15 21:52:52,478 INFO L600 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-11-15 21:52:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-15 21:52:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-11-15 21:52:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-15 21:52:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 732 transitions. [2019-11-15 21:52:52,491 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 732 transitions. Word has length 105 [2019-11-15 21:52:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:52,491 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 732 transitions. [2019-11-15 21:52:52,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 732 transitions. [2019-11-15 21:52:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 21:52:52,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:52,493 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:52,494 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 958806617, now seen corresponding path program 1 times [2019-11-15 21:52:52,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:52,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349948204] [2019-11-15 21:52:52,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:52:52,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349948204] [2019-11-15 21:52:52,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:52,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:52,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774531824] [2019-11-15 21:52:52,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:52,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:52,578 INFO L87 Difference]: Start difference. First operand 495 states and 732 transitions. Second operand 3 states. [2019-11-15 21:52:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:52,647 INFO L93 Difference]: Finished difference Result 1208 states and 1802 transitions. [2019-11-15 21:52:52,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:52,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-15 21:52:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:52,651 INFO L225 Difference]: With dead ends: 1208 [2019-11-15 21:52:52,652 INFO L226 Difference]: Without dead ends: 732 [2019-11-15 21:52:52,653 INFO L600 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-11-15 21:52:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-15 21:52:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2019-11-15 21:52:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-11-15 21:52:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1082 transitions. [2019-11-15 21:52:52,672 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1082 transitions. Word has length 124 [2019-11-15 21:52:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:52,672 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 1082 transitions. [2019-11-15 21:52:52,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1082 transitions. [2019-11-15 21:52:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 21:52:52,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:52,675 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:52,675 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1787782109, now seen corresponding path program 1 times [2019-11-15 21:52:52,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:52,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567396633] [2019-11-15 21:52:52,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 21:52:52,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567396633] [2019-11-15 21:52:52,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:52,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:52,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522875529] [2019-11-15 21:52:52,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:52,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:52,779 INFO L87 Difference]: Start difference. First operand 732 states and 1082 transitions. Second operand 3 states. [2019-11-15 21:52:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:52,880 INFO L93 Difference]: Finished difference Result 1675 states and 2491 transitions. [2019-11-15 21:52:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:52,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 21:52:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:52,885 INFO L225 Difference]: With dead ends: 1675 [2019-11-15 21:52:52,885 INFO L226 Difference]: Without dead ends: 962 [2019-11-15 21:52:52,886 INFO L600 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-11-15 21:52:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-11-15 21:52:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-11-15 21:52:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-11-15 21:52:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1420 transitions. [2019-11-15 21:52:52,911 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1420 transitions. Word has length 167 [2019-11-15 21:52:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:52,912 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1420 transitions. [2019-11-15 21:52:52,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1420 transitions. [2019-11-15 21:52:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 21:52:52,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:52,916 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:52:52,916 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1469041126, now seen corresponding path program 1 times [2019-11-15 21:52:52,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:52,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557523647] [2019-11-15 21:52:52,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:52,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 21:52:53,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557523647] [2019-11-15 21:52:53,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:53,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:53,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977758321] [2019-11-15 21:52:53,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:53,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:53,019 INFO L87 Difference]: Start difference. First operand 962 states and 1420 transitions. Second operand 3 states. [2019-11-15 21:52:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:53,102 INFO L93 Difference]: Finished difference Result 2142 states and 3178 transitions. [2019-11-15 21:52:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:53,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-15 21:52:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:53,108 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 21:52:53,108 INFO L226 Difference]: Without dead ends: 1199 [2019-11-15 21:52:53,110 INFO L600 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-11-15 21:52:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-15 21:52:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-11-15 21:52:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-11-15 21:52:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1772 transitions. [2019-11-15 21:52:53,141 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1772 transitions. Word has length 206 [2019-11-15 21:52:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:53,141 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1772 transitions. [2019-11-15 21:52:53,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1772 transitions. [2019-11-15 21:52:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 21:52:53,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:53,145 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:53,145 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1351692763, now seen corresponding path program 1 times [2019-11-15 21:52:53,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:53,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172545088] [2019-11-15 21:52:53,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-15 21:52:53,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172545088] [2019-11-15 21:52:53,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:53,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:53,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506303371] [2019-11-15 21:52:53,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:53,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:53,269 INFO L87 Difference]: Start difference. First operand 1199 states and 1772 transitions. Second operand 3 states. [2019-11-15 21:52:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:53,358 INFO L93 Difference]: Finished difference Result 2616 states and 3882 transitions. [2019-11-15 21:52:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:53,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-15 21:52:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:53,366 INFO L225 Difference]: With dead ends: 2616 [2019-11-15 21:52:53,367 INFO L226 Difference]: Without dead ends: 1436 [2019-11-15 21:52:53,369 INFO L600 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-11-15 21:52:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-15 21:52:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2019-11-15 21:52:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-11-15 21:52:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2125 transitions. [2019-11-15 21:52:53,408 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2125 transitions. Word has length 248 [2019-11-15 21:52:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:53,410 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2125 transitions. [2019-11-15 21:52:53,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2125 transitions. [2019-11-15 21:52:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 21:52:53,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:53,414 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-15 21:52:53,414 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2051139709, now seen corresponding path program 1 times [2019-11-15 21:52:53,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:53,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838134045] [2019-11-15 21:52:53,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:53,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 21:52:53,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838134045] [2019-11-15 21:52:53,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:53,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:53,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587776056] [2019-11-15 21:52:53,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:53,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:53,587 INFO L87 Difference]: Start difference. First operand 1436 states and 2125 transitions. Second operand 4 states. [2019-11-15 21:52:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,125 INFO L93 Difference]: Finished difference Result 3480 states and 5177 transitions. [2019-11-15 21:52:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:54,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-11-15 21:52:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,136 INFO L225 Difference]: With dead ends: 3480 [2019-11-15 21:52:54,136 INFO L226 Difference]: Without dead ends: 2063 [2019-11-15 21:52:54,138 INFO L600 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-11-15 21:52:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-11-15 21:52:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1682. [2019-11-15 21:52:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-15 21:52:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2575 transitions. [2019-11-15 21:52:54,186 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2575 transitions. Word has length 292 [2019-11-15 21:52:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,186 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2575 transitions. [2019-11-15 21:52:54,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2575 transitions. [2019-11-15 21:52:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 21:52:54,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,190 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-15 21:52:54,191 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1659055937, now seen corresponding path program 1 times [2019-11-15 21:52:54,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980525019] [2019-11-15 21:52:54,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-15 21:52:54,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980525019] [2019-11-15 21:52:54,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:54,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:54,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930429264] [2019-11-15 21:52:54,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:54,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:54,406 INFO L87 Difference]: Start difference. First operand 1682 states and 2575 transitions. Second operand 3 states. [2019-11-15 21:52:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,525 INFO L93 Difference]: Finished difference Result 3617 states and 5554 transitions. [2019-11-15 21:52:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:54,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-15 21:52:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,536 INFO L225 Difference]: With dead ends: 3617 [2019-11-15 21:52:54,536 INFO L226 Difference]: Without dead ends: 1954 [2019-11-15 21:52:54,538 INFO L600 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-11-15 21:52:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-11-15 21:52:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2019-11-15 21:52:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-15 21:52:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2989 transitions. [2019-11-15 21:52:54,587 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2989 transitions. Word has length 292 [2019-11-15 21:52:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,588 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2989 transitions. [2019-11-15 21:52:54,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2989 transitions. [2019-11-15 21:52:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 21:52:54,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,592 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 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] [2019-11-15 21:52:54,593 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash 305516341, now seen corresponding path program 1 times [2019-11-15 21:52:54,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985260083] [2019-11-15 21:52:54,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-11-15 21:52:54,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985260083] [2019-11-15 21:52:54,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:54,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:54,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216416018] [2019-11-15 21:52:54,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:54,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:54,763 INFO L87 Difference]: Start difference. First operand 1954 states and 2989 transitions. Second operand 3 states. [2019-11-15 21:52:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,865 INFO L93 Difference]: Finished difference Result 4167 states and 6391 transitions. [2019-11-15 21:52:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:54,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-15 21:52:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,877 INFO L225 Difference]: With dead ends: 4167 [2019-11-15 21:52:54,877 INFO L226 Difference]: Without dead ends: 2232 [2019-11-15 21:52:54,880 INFO L600 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-11-15 21:52:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-11-15 21:52:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2232. [2019-11-15 21:52:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-11-15 21:52:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3419 transitions. [2019-11-15 21:52:54,938 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3419 transitions. Word has length 332 [2019-11-15 21:52:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,939 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 3419 transitions. [2019-11-15 21:52:54,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3419 transitions. [2019-11-15 21:52:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-15 21:52:54,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,944 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 3, 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] [2019-11-15 21:52:54,944 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1358098452, now seen corresponding path program 1 times [2019-11-15 21:52:54,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129384240] [2019-11-15 21:52:54,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-15 21:52:55,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129384240] [2019-11-15 21:52:55,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:55,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:55,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284084172] [2019-11-15 21:52:55,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:55,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:55,140 INFO L87 Difference]: Start difference. First operand 2232 states and 3419 transitions. Second operand 3 states. [2019-11-15 21:52:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:55,245 INFO L93 Difference]: Finished difference Result 4723 states and 7251 transitions. [2019-11-15 21:52:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:55,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-15 21:52:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:55,258 INFO L225 Difference]: With dead ends: 4723 [2019-11-15 21:52:55,259 INFO L226 Difference]: Without dead ends: 2510 [2019-11-15 21:52:55,261 INFO L600 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-11-15 21:52:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-11-15 21:52:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2510. [2019-11-15 21:52:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-11-15 21:52:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3850 transitions. [2019-11-15 21:52:55,331 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3850 transitions. Word has length 375 [2019-11-15 21:52:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:55,332 INFO L462 AbstractCegarLoop]: Abstraction has 2510 states and 3850 transitions. [2019-11-15 21:52:55,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3850 transitions. [2019-11-15 21:52:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-15 21:52:55,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:55,338 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:55,338 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2117366755, now seen corresponding path program 1 times [2019-11-15 21:52:55,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:55,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466005606] [2019-11-15 21:52:55,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-11-15 21:52:55,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466005606] [2019-11-15 21:52:55,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:55,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:55,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007271321] [2019-11-15 21:52:55,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:55,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:55,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:55,650 INFO L87 Difference]: Start difference. First operand 2510 states and 3850 transitions. Second operand 3 states. [2019-11-15 21:52:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:55,771 INFO L93 Difference]: Finished difference Result 5274 states and 8106 transitions. [2019-11-15 21:52:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:55,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-15 21:52:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:55,791 INFO L225 Difference]: With dead ends: 5274 [2019-11-15 21:52:55,797 INFO L226 Difference]: Without dead ends: 2783 [2019-11-15 21:52:55,801 INFO L600 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-11-15 21:52:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2019-11-15 21:52:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2783. [2019-11-15 21:52:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2019-11-15 21:52:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 4265 transitions. [2019-11-15 21:52:55,870 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 4265 transitions. Word has length 420 [2019-11-15 21:52:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:55,871 INFO L462 AbstractCegarLoop]: Abstraction has 2783 states and 4265 transitions. [2019-11-15 21:52:55,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 4265 transitions. [2019-11-15 21:52:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-11-15 21:52:55,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:55,878 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:55,878 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1441569685, now seen corresponding path program 1 times [2019-11-15 21:52:55,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:55,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826071571] [2019-11-15 21:52:55,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:55,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2019-11-15 21:52:56,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826071571] [2019-11-15 21:52:56,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:56,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:56,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932178252] [2019-11-15 21:52:56,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:56,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:56,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:56,144 INFO L87 Difference]: Start difference. First operand 2783 states and 4265 transitions. Second operand 3 states. [2019-11-15 21:52:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:56,246 INFO L93 Difference]: Finished difference Result 5825 states and 8943 transitions. [2019-11-15 21:52:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:56,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2019-11-15 21:52:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:56,257 INFO L225 Difference]: With dead ends: 5825 [2019-11-15 21:52:56,258 INFO L226 Difference]: Without dead ends: 3061 [2019-11-15 21:52:56,261 INFO L600 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-11-15 21:52:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-15 21:52:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3061. [2019-11-15 21:52:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-15 21:52:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4698 transitions. [2019-11-15 21:52:56,334 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4698 transitions. Word has length 461 [2019-11-15 21:52:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:56,335 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4698 transitions. [2019-11-15 21:52:56,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4698 transitions. [2019-11-15 21:52:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-15 21:52:56,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:56,343 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:52:56,343 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 626733859, now seen corresponding path program 1 times [2019-11-15 21:52:56,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:56,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762798860] [2019-11-15 21:52:56,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 1929 trivial. 0 not checked. [2019-11-15 21:52:56,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762798860] [2019-11-15 21:52:56,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:56,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:56,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246035755] [2019-11-15 21:52:56,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:52:56,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:52:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:52:56,716 INFO L87 Difference]: Start difference. First operand 3061 states and 4698 transitions. Second operand 3 states. [2019-11-15 21:52:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:56,817 INFO L93 Difference]: Finished difference Result 3341 states and 5134 transitions. [2019-11-15 21:52:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:52:56,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-11-15 21:52:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:56,824 INFO L225 Difference]: With dead ends: 3341 [2019-11-15 21:52:56,825 INFO L226 Difference]: Without dead ends: 3339 [2019-11-15 21:52:56,826 INFO L600 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-11-15 21:52:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-11-15 21:52:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3339. [2019-11-15 21:52:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-11-15 21:52:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 5132 transitions. [2019-11-15 21:52:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 5132 transitions. Word has length 505 [2019-11-15 21:52:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:56,895 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 5132 transitions. [2019-11-15 21:52:56,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:52:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 5132 transitions. [2019-11-15 21:52:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-15 21:52:56,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:56,904 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:56,904 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2042840060, now seen corresponding path program 1 times [2019-11-15 21:52:56,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:56,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026344358] [2019-11-15 21:52:56,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1704 proven. 24 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-11-15 21:52:57,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026344358] [2019-11-15 21:52:57,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309365338] [2019-11-15 21:52:57,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:58,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 21:52:58,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:58,102 INFO L375 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 8 [2019-11-15 21:52:58,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:52:58,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:52:58,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-15 21:52:58,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:19 [2019-11-15 21:52:58,262 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_159|], 6=[|v_#memory_int_179|]} [2019-11-15 21:52:58,266 INFO L375 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 25 [2019-11-15 21:52:58,267 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:58,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,280 INFO L375 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 25 treesize of output 13 [2019-11-15 21:52:58,280 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:58,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,373 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 21:52:58,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 103 [2019-11-15 21:52:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:58,378 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,424 INFO L567 ElimStorePlain]: treesize reduction 56, result has 42.3 percent of original size [2019-11-15 21:52:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:58,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:58,427 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:41 [2019-11-15 21:52:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:58,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:58,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-15 21:52:58,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:58,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 113 [2019-11-15 21:52:58,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,633 INFO L567 ElimStorePlain]: treesize reduction 56, result has 58.8 percent of original size [2019-11-15 21:52:58,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:52:58,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-11-15 21:52:58,794 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-15 21:52:58,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2019-11-15 21:52:58,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:58,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:58,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:4 [2019-11-15 21:52:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1704 proven. 24 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-11-15 21:52:59,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:59,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2019-11-15 21:52:59,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306306725] [2019-11-15 21:52:59,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:52:59,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:52:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:52:59,118 INFO L87 Difference]: Start difference. First operand 3339 states and 5132 transitions. Second operand 15 states. [2019-11-15 21:53:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:04,807 INFO L93 Difference]: Finished difference Result 16379 states and 25278 transitions. [2019-11-15 21:53:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 21:53:04,808 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 551 [2019-11-15 21:53:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:04,832 INFO L225 Difference]: With dead ends: 16379 [2019-11-15 21:53:04,833 INFO L226 Difference]: Without dead ends: 13059 [2019-11-15 21:53:04,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 21:53:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13059 states. [2019-11-15 21:53:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13059 to 8652. [2019-11-15 21:53:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8652 states. [2019-11-15 21:53:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 14003 transitions. [2019-11-15 21:53:05,089 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 14003 transitions. Word has length 551 [2019-11-15 21:53:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:05,090 INFO L462 AbstractCegarLoop]: Abstraction has 8652 states and 14003 transitions. [2019-11-15 21:53:05,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:53:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 14003 transitions. [2019-11-15 21:53:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-15 21:53:05,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:05,111 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:05,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:05,325 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2130443706, now seen corresponding path program 1 times [2019-11-15 21:53:05,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:05,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716235355] [2019-11-15 21:53:05,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:05,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:05,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2767 backedges. 1532 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-11-15 21:53:05,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716235355] [2019-11-15 21:53:05,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:05,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:05,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324624501] [2019-11-15 21:53:05,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:05,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:05,738 INFO L87 Difference]: Start difference. First operand 8652 states and 14003 transitions. Second operand 4 states. [2019-11-15 21:53:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:06,229 INFO L93 Difference]: Finished difference Result 18583 states and 29686 transitions. [2019-11-15 21:53:06,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:06,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 554 [2019-11-15 21:53:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:06,246 INFO L225 Difference]: With dead ends: 18583 [2019-11-15 21:53:06,247 INFO L226 Difference]: Without dead ends: 9950 [2019-11-15 21:53:06,255 INFO L600 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-11-15 21:53:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9950 states. [2019-11-15 21:53:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9950 to 8676. [2019-11-15 21:53:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8676 states. [2019-11-15 21:53:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8676 states to 8676 states and 14027 transitions. [2019-11-15 21:53:06,475 INFO L78 Accepts]: Start accepts. Automaton has 8676 states and 14027 transitions. Word has length 554 [2019-11-15 21:53:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:06,476 INFO L462 AbstractCegarLoop]: Abstraction has 8676 states and 14027 transitions. [2019-11-15 21:53:06,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8676 states and 14027 transitions. [2019-11-15 21:53:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-15 21:53:06,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:06,493 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:06,493 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:06,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1861417636, now seen corresponding path program 1 times [2019-11-15 21:53:06,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:06,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998386149] [2019-11-15 21:53:06,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:06,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:06,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 1716 proven. 27 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2019-11-15 21:53:07,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998386149] [2019-11-15 21:53:07,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751620188] [2019-11-15 21:53:07,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:07,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:53:07,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:07,636 INFO L375 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 8 [2019-11-15 21:53:07,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:53:07,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:53:07,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-15 21:53:07,669 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:9 [2019-11-15 21:53:07,685 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_161|], 2=[|v_#memory_int_182|]} [2019-11-15 21:53:07,688 INFO L375 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 25 [2019-11-15 21:53:07,688 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:07,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,703 INFO L375 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 25 treesize of output 13 [2019-11-15 21:53:07,704 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:07,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 21:53:07,734 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,755 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 21:53:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:07,757 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 21:53:07,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 21:53:07,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:53:07,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,874 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-15 21:53:07,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:53:07,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 21:53:07,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 10 [2019-11-15 21:53:07,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,920 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:53:07,920 INFO L375 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 10 [2019-11-15 21:53:07,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:53:07,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-15 21:53:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 1716 proven. 27 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2019-11-15 21:53:08,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:53:08,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-11-15 21:53:08,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464520154] [2019-11-15 21:53:08,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:53:08,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:53:08,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:53:08,169 INFO L87 Difference]: Start difference. First operand 8676 states and 14027 transitions. Second operand 12 states. [2019-11-15 21:53:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:11,204 INFO L93 Difference]: Finished difference Result 26384 states and 41527 transitions. [2019-11-15 21:53:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:53:11,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 554 [2019-11-15 21:53:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:11,232 INFO L225 Difference]: With dead ends: 26384 [2019-11-15 21:53:11,233 INFO L226 Difference]: Without dead ends: 17727 [2019-11-15 21:53:11,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:53:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17727 states. [2019-11-15 21:53:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17727 to 9864. [2019-11-15 21:53:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16211 transitions. [2019-11-15 21:53:11,726 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16211 transitions. Word has length 554 [2019-11-15 21:53:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:11,727 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16211 transitions. [2019-11-15 21:53:11,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:53:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16211 transitions. [2019-11-15 21:53:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-11-15 21:53:11,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:11,746 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:11,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:11,960 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash 652835212, now seen corresponding path program 1 times [2019-11-15 21:53:11,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:11,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318784991] [2019-11-15 21:53:11,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:11,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2019-11-15 21:53:12,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318784991] [2019-11-15 21:53:12,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:12,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:12,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010103613] [2019-11-15 21:53:12,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:12,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:12,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:12,311 INFO L87 Difference]: Start difference. First operand 9864 states and 16211 transitions. Second operand 4 states. [2019-11-15 21:53:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:13,066 INFO L93 Difference]: Finished difference Result 20911 states and 33957 transitions. [2019-11-15 21:53:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:13,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 596 [2019-11-15 21:53:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:13,077 INFO L225 Difference]: With dead ends: 20911 [2019-11-15 21:53:13,078 INFO L226 Difference]: Without dead ends: 11066 [2019-11-15 21:53:13,087 INFO L600 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-11-15 21:53:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-11-15 21:53:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 9864. [2019-11-15 21:53:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16187 transitions. [2019-11-15 21:53:13,340 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16187 transitions. Word has length 596 [2019-11-15 21:53:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:13,340 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16187 transitions. [2019-11-15 21:53:13,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16187 transitions. [2019-11-15 21:53:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-15 21:53:13,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:13,359 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:13,359 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1511565327, now seen corresponding path program 1 times [2019-11-15 21:53:13,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:13,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184032875] [2019-11-15 21:53:13,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:13,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:13,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 1441 proven. 0 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2019-11-15 21:53:13,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184032875] [2019-11-15 21:53:13,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:13,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:13,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653852622] [2019-11-15 21:53:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:13,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:13,740 INFO L87 Difference]: Start difference. First operand 9864 states and 16187 transitions. Second operand 4 states. [2019-11-15 21:53:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:14,414 INFO L93 Difference]: Finished difference Result 20911 states and 33909 transitions. [2019-11-15 21:53:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:14,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-11-15 21:53:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:14,422 INFO L225 Difference]: With dead ends: 20911 [2019-11-15 21:53:14,422 INFO L226 Difference]: Without dead ends: 11066 [2019-11-15 21:53:14,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-11-15 21:53:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 9864. [2019-11-15 21:53:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16163 transitions. [2019-11-15 21:53:14,623 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16163 transitions. Word has length 599 [2019-11-15 21:53:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:14,623 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16163 transitions. [2019-11-15 21:53:14,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16163 transitions. [2019-11-15 21:53:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-11-15 21:53:14,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:14,632 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:14,632 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 93978833, now seen corresponding path program 1 times [2019-11-15 21:53:14,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:14,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662484437] [2019-11-15 21:53:14,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:14,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:14,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3172 backedges. 1467 proven. 0 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2019-11-15 21:53:14,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662484437] [2019-11-15 21:53:14,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:14,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:14,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059863030] [2019-11-15 21:53:14,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:14,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:14,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:14,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:14,978 INFO L87 Difference]: Start difference. First operand 9864 states and 16163 transitions. Second operand 4 states. [2019-11-15 21:53:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:15,603 INFO L93 Difference]: Finished difference Result 20911 states and 33861 transitions. [2019-11-15 21:53:15,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:15,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 602 [2019-11-15 21:53:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:15,612 INFO L225 Difference]: With dead ends: 20911 [2019-11-15 21:53:15,612 INFO L226 Difference]: Without dead ends: 11066 [2019-11-15 21:53:15,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-11-15 21:53:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 9864. [2019-11-15 21:53:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16139 transitions. [2019-11-15 21:53:15,801 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16139 transitions. Word has length 602 [2019-11-15 21:53:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:15,802 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16139 transitions. [2019-11-15 21:53:15,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16139 transitions. [2019-11-15 21:53:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-11-15 21:53:15,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:15,810 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:15,810 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash 962155338, now seen corresponding path program 1 times [2019-11-15 21:53:15,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:15,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085238755] [2019-11-15 21:53:15,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:15,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3217 backedges. 1493 proven. 0 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2019-11-15 21:53:16,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085238755] [2019-11-15 21:53:16,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:16,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:16,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452540841] [2019-11-15 21:53:16,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:16,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:16,258 INFO L87 Difference]: Start difference. First operand 9864 states and 16139 transitions. Second operand 4 states. [2019-11-15 21:53:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:16,891 INFO L93 Difference]: Finished difference Result 20791 states and 33669 transitions. [2019-11-15 21:53:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:16,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-11-15 21:53:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:16,899 INFO L225 Difference]: With dead ends: 20791 [2019-11-15 21:53:16,899 INFO L226 Difference]: Without dead ends: 10946 [2019-11-15 21:53:16,904 INFO L600 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-11-15 21:53:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10946 states. [2019-11-15 21:53:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10946 to 9864. [2019-11-15 21:53:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16115 transitions. [2019-11-15 21:53:17,076 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16115 transitions. Word has length 605 [2019-11-15 21:53:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:17,076 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16115 transitions. [2019-11-15 21:53:17,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16115 transitions. [2019-11-15 21:53:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-11-15 21:53:17,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:17,084 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:17,085 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1280155236, now seen corresponding path program 1 times [2019-11-15 21:53:17,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:17,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527999210] [2019-11-15 21:53:17,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 1681 proven. 0 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-15 21:53:17,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527999210] [2019-11-15 21:53:17,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:17,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:17,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457410327] [2019-11-15 21:53:17,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:17,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:17,432 INFO L87 Difference]: Start difference. First operand 9864 states and 16115 transitions. Second operand 4 states. [2019-11-15 21:53:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:18,017 INFO L93 Difference]: Finished difference Result 20791 states and 33621 transitions. [2019-11-15 21:53:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:18,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 617 [2019-11-15 21:53:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:18,025 INFO L225 Difference]: With dead ends: 20791 [2019-11-15 21:53:18,025 INFO L226 Difference]: Without dead ends: 10946 [2019-11-15 21:53:18,030 INFO L600 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-11-15 21:53:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10946 states. [2019-11-15 21:53:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10946 to 9864. [2019-11-15 21:53:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-11-15 21:53:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 16091 transitions. [2019-11-15 21:53:18,205 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 16091 transitions. Word has length 617 [2019-11-15 21:53:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:18,205 INFO L462 AbstractCegarLoop]: Abstraction has 9864 states and 16091 transitions. [2019-11-15 21:53:18,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 16091 transitions. [2019-11-15 21:53:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-11-15 21:53:18,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:18,215 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:18,215 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -974729450, now seen corresponding path program 1 times [2019-11-15 21:53:18,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:18,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547245099] [2019-11-15 21:53:18,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:18,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:18,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3586 backedges. 1954 proven. 82 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-11-15 21:53:18,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547245099] [2019-11-15 21:53:18,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371486345] [2019-11-15 21:53:18,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:19,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:53:19,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:19,134 INFO L375 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 8 [2019-11-15 21:53:19,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:19,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:53:19,153 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:53:19,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:53:19,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:19,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:53:19,186 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:53:19,187 INFO L375 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 10 [2019-11-15 21:53:19,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:19,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:19,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:53:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3586 backedges. 1931 proven. 46 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2019-11-15 21:53:19,440 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:53:19,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-15 21:53:19,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495593197] [2019-11-15 21:53:19,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:53:19,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:53:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:53:19,442 INFO L87 Difference]: Start difference. First operand 9864 states and 16091 transitions. Second operand 11 states. [2019-11-15 21:53:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:21,181 INFO L93 Difference]: Finished difference Result 23863 states and 38102 transitions. [2019-11-15 21:53:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:53:21,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 617 [2019-11-15 21:53:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:21,192 INFO L225 Difference]: With dead ends: 23863 [2019-11-15 21:53:21,192 INFO L226 Difference]: Without dead ends: 14018 [2019-11-15 21:53:21,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 615 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:53:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2019-11-15 21:53:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 10536. [2019-11-15 21:53:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10536 states. [2019-11-15 21:53:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 17063 transitions. [2019-11-15 21:53:21,416 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 17063 transitions. Word has length 617 [2019-11-15 21:53:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:21,416 INFO L462 AbstractCegarLoop]: Abstraction has 10536 states and 17063 transitions. [2019-11-15 21:53:21,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:53:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 17063 transitions. [2019-11-15 21:53:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-11-15 21:53:21,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:21,427 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:21,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:21,633 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1765285929, now seen corresponding path program 1 times [2019-11-15 21:53:21,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:21,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724741191] [2019-11-15 21:53:21,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:21,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3568 backedges. 1701 proven. 0 refuted. 0 times theorem prover too weak. 1867 trivial. 0 not checked. [2019-11-15 21:53:22,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724741191] [2019-11-15 21:53:22,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:22,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:22,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278163296] [2019-11-15 21:53:22,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:22,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:22,127 INFO L87 Difference]: Start difference. First operand 10536 states and 17063 transitions. Second operand 4 states. [2019-11-15 21:53:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:22,733 INFO L93 Difference]: Finished difference Result 22039 states and 35379 transitions. [2019-11-15 21:53:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:22,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 620 [2019-11-15 21:53:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:22,742 INFO L225 Difference]: With dead ends: 22039 [2019-11-15 21:53:22,742 INFO L226 Difference]: Without dead ends: 11522 [2019-11-15 21:53:22,749 INFO L600 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-11-15 21:53:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11522 states. [2019-11-15 21:53:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11522 to 10536. [2019-11-15 21:53:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10536 states. [2019-11-15 21:53:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 17039 transitions. [2019-11-15 21:53:22,944 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 17039 transitions. Word has length 620 [2019-11-15 21:53:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:22,944 INFO L462 AbstractCegarLoop]: Abstraction has 10536 states and 17039 transitions. [2019-11-15 21:53:22,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 17039 transitions. [2019-11-15 21:53:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2019-11-15 21:53:22,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:22,952 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:22,953 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1933960729, now seen corresponding path program 1 times [2019-11-15 21:53:22,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:22,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419249984] [2019-11-15 21:53:22,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:22,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:22,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3754 backedges. 1942 proven. 0 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-11-15 21:53:23,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419249984] [2019-11-15 21:53:23,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:23,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:23,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841283062] [2019-11-15 21:53:23,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:23,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:23,306 INFO L87 Difference]: Start difference. First operand 10536 states and 17039 transitions. Second operand 4 states. [2019-11-15 21:53:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:23,810 INFO L93 Difference]: Finished difference Result 21845 states and 35262 transitions. [2019-11-15 21:53:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:23,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 629 [2019-11-15 21:53:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:23,818 INFO L225 Difference]: With dead ends: 21845 [2019-11-15 21:53:23,818 INFO L226 Difference]: Without dead ends: 11328 [2019-11-15 21:53:23,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11328 states. [2019-11-15 21:53:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11328 to 10896. [2019-11-15 21:53:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10896 states. [2019-11-15 21:53:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10896 states to 10896 states and 17663 transitions. [2019-11-15 21:53:24,016 INFO L78 Accepts]: Start accepts. Automaton has 10896 states and 17663 transitions. Word has length 629 [2019-11-15 21:53:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:24,017 INFO L462 AbstractCegarLoop]: Abstraction has 10896 states and 17663 transitions. [2019-11-15 21:53:24,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10896 states and 17663 transitions. [2019-11-15 21:53:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-11-15 21:53:24,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:24,026 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 17, 17, 17, 17, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:24,026 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:24,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1526031170, now seen corresponding path program 1 times [2019-11-15 21:53:24,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:24,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774896127] [2019-11-15 21:53:24,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:24,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3652 backedges. 1682 proven. 0 refuted. 0 times theorem prover too weak. 1970 trivial. 0 not checked. [2019-11-15 21:53:24,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774896127] [2019-11-15 21:53:24,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:24,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:24,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878168466] [2019-11-15 21:53:24,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:24,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:24,520 INFO L87 Difference]: Start difference. First operand 10896 states and 17663 transitions. Second operand 4 states. [2019-11-15 21:53:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:25,035 INFO L93 Difference]: Finished difference Result 22589 states and 36396 transitions. [2019-11-15 21:53:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:25,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 638 [2019-11-15 21:53:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:25,043 INFO L225 Difference]: With dead ends: 22589 [2019-11-15 21:53:25,043 INFO L226 Difference]: Without dead ends: 11712 [2019-11-15 21:53:25,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11712 states. [2019-11-15 21:53:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11712 to 10896. [2019-11-15 21:53:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10896 states. [2019-11-15 21:53:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10896 states to 10896 states and 17639 transitions. [2019-11-15 21:53:25,256 INFO L78 Accepts]: Start accepts. Automaton has 10896 states and 17639 transitions. Word has length 638 [2019-11-15 21:53:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:25,256 INFO L462 AbstractCegarLoop]: Abstraction has 10896 states and 17639 transitions. [2019-11-15 21:53:25,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10896 states and 17639 transitions. [2019-11-15 21:53:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-11-15 21:53:25,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:25,266 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:25,266 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -343877525, now seen corresponding path program 1 times [2019-11-15 21:53:25,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:25,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443063240] [2019-11-15 21:53:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:25,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:26,578 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-11-15 21:53:26,719 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-11-15 21:53:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3895 backedges. 1638 proven. 250 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-11-15 21:53:27,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443063240] [2019-11-15 21:53:27,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611736578] [2019-11-15 21:53:27,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 21:53:28,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:28,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 31 [2019-11-15 21:53:28,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,458 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_163|, |v_#memory_$Pointer$.base_162|]} [2019-11-15 21:53:28,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:53:28,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:28,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:53:28,566 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,640 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:53:28,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:53:28,641 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,659 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 21:53:28,743 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:53:28,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:53:28,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:53:28,811 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:53:28,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:53:28,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:53:28,829 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-15 21:53:28,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:28,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,930 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:53:28,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:53:28,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:28,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:28,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:53:29,001 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_185|], 12=[|v_#memory_$Pointer$.base_169|]} [2019-11-15 21:53:29,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-15 21:53:29,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:53:29,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2019-11-15 21:53:29,138 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_186|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 21:53:29,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-15 21:53:29,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:53:29,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:81 [2019-11-15 21:53:29,261 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 6=[|v_#memory_$Pointer$.base_171|], 12=[|v_#memory_int_187|]} [2019-11-15 21:53:29,265 INFO L375 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 49 treesize of output 37 [2019-11-15 21:53:29,265 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:29,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:29,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 36 [2019-11-15 21:53:29,295 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:29,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,323 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-15 21:53:29,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2019-11-15 21:53:29,324 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,336 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:29 [2019-11-15 21:53:29,386 INFO L341 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2019-11-15 21:53:29,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:53:29,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:29 [2019-11-15 21:53:29,425 INFO L375 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 43 treesize of output 35 [2019-11-15 21:53:29,437 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-15 21:53:29,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 21:53:29,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:29,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 21:53:29,444 INFO L567 ElimStorePlain]: treesize reduction 21, result has 16.0 percent of original size [2019-11-15 21:53:29,444 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:29,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:29,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:4 [2019-11-15 21:53:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3895 backedges. 1291 proven. 64 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2019-11-15 21:53:30,179 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:53:30,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2019-11-15 21:53:30,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866423528] [2019-11-15 21:53:30,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 21:53:30,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 21:53:30,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:53:30,181 INFO L87 Difference]: Start difference. First operand 10896 states and 17639 transitions. Second operand 24 states. [2019-11-15 21:53:37,923 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-11-15 21:53:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:43,169 INFO L93 Difference]: Finished difference Result 83211 states and 129509 transitions. [2019-11-15 21:53:43,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-11-15 21:53:43,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 638 [2019-11-15 21:53:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:43,231 INFO L225 Difference]: With dead ends: 83211 [2019-11-15 21:53:43,231 INFO L226 Difference]: Without dead ends: 72208 [2019-11-15 21:53:43,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 657 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4134 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1853, Invalid=9277, Unknown=0, NotChecked=0, Total=11130 [2019-11-15 21:53:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72208 states. [2019-11-15 21:53:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72208 to 48765. [2019-11-15 21:53:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48765 states. [2019-11-15 21:53:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48765 states to 48765 states and 78935 transitions. [2019-11-15 21:53:44,606 INFO L78 Accepts]: Start accepts. Automaton has 48765 states and 78935 transitions. Word has length 638 [2019-11-15 21:53:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:44,606 INFO L462 AbstractCegarLoop]: Abstraction has 48765 states and 78935 transitions. [2019-11-15 21:53:44,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 21:53:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 48765 states and 78935 transitions. [2019-11-15 21:53:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-11-15 21:53:44,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:44,640 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:44,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:44,841 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash 812367075, now seen corresponding path program 1 times [2019-11-15 21:53:44,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:44,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174490501] [2019-11-15 21:53:44,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:44,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:44,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4019 backedges. 993 proven. 0 refuted. 0 times theorem prover too weak. 3026 trivial. 0 not checked. [2019-11-15 21:53:45,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174490501] [2019-11-15 21:53:45,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:45,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:45,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394674459] [2019-11-15 21:53:45,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:45,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:45,239 INFO L87 Difference]: Start difference. First operand 48765 states and 78935 transitions. Second operand 4 states. [2019-11-15 21:53:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:47,368 INFO L93 Difference]: Finished difference Result 81356 states and 130908 transitions. [2019-11-15 21:53:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:47,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 654 [2019-11-15 21:53:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:47,435 INFO L225 Difference]: With dead ends: 81356 [2019-11-15 21:53:47,435 INFO L226 Difference]: Without dead ends: 53433 [2019-11-15 21:53:47,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53433 states. [2019-11-15 21:53:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53433 to 49413. [2019-11-15 21:53:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49413 states. [2019-11-15 21:53:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49413 states to 49413 states and 79841 transitions. [2019-11-15 21:53:49,388 INFO L78 Accepts]: Start accepts. Automaton has 49413 states and 79841 transitions. Word has length 654 [2019-11-15 21:53:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:49,389 INFO L462 AbstractCegarLoop]: Abstraction has 49413 states and 79841 transitions. [2019-11-15 21:53:49,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 49413 states and 79841 transitions. [2019-11-15 21:53:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-11-15 21:53:49,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:49,424 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:49,425 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash 830919156, now seen corresponding path program 1 times [2019-11-15 21:53:49,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:49,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982848074] [2019-11-15 21:53:49,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:49,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:49,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4036 backedges. 1010 proven. 0 refuted. 0 times theorem prover too weak. 3026 trivial. 0 not checked. [2019-11-15 21:53:49,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982848074] [2019-11-15 21:53:49,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:49,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:49,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446130155] [2019-11-15 21:53:49,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:49,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:49,769 INFO L87 Difference]: Start difference. First operand 49413 states and 79841 transitions. Second operand 4 states. [2019-11-15 21:53:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:51,521 INFO L93 Difference]: Finished difference Result 81716 states and 131352 transitions. [2019-11-15 21:53:51,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:51,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 655 [2019-11-15 21:53:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:51,570 INFO L225 Difference]: With dead ends: 81716 [2019-11-15 21:53:51,570 INFO L226 Difference]: Without dead ends: 53433 [2019-11-15 21:53:51,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53433 states. [2019-11-15 21:53:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53433 to 49467. [2019-11-15 21:53:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49467 states. [2019-11-15 21:53:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49467 states to 49467 states and 79883 transitions. [2019-11-15 21:53:52,737 INFO L78 Accepts]: Start accepts. Automaton has 49467 states and 79883 transitions. Word has length 655 [2019-11-15 21:53:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:52,738 INFO L462 AbstractCegarLoop]: Abstraction has 49467 states and 79883 transitions. [2019-11-15 21:53:52,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49467 states and 79883 transitions. [2019-11-15 21:53:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-11-15 21:53:52,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:52,774 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:52,774 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash 531014366, now seen corresponding path program 1 times [2019-11-15 21:53:52,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:52,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874142748] [2019-11-15 21:53:52,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:52,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:52,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4053 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 3026 trivial. 0 not checked. [2019-11-15 21:53:53,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874142748] [2019-11-15 21:53:53,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:53,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:53,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236546965] [2019-11-15 21:53:53,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:53,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:53,543 INFO L87 Difference]: Start difference. First operand 49467 states and 79883 transitions. Second operand 4 states. [2019-11-15 21:53:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:55,045 INFO L93 Difference]: Finished difference Result 81746 states and 131316 transitions. [2019-11-15 21:53:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:55,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 656 [2019-11-15 21:53:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:55,095 INFO L225 Difference]: With dead ends: 81746 [2019-11-15 21:53:55,095 INFO L226 Difference]: Without dead ends: 53433 [2019-11-15 21:53:55,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53433 states. [2019-11-15 21:53:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53433 to 49521. [2019-11-15 21:53:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49521 states. [2019-11-15 21:53:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49521 states to 49521 states and 79925 transitions. [2019-11-15 21:53:56,295 INFO L78 Accepts]: Start accepts. Automaton has 49521 states and 79925 transitions. Word has length 656 [2019-11-15 21:53:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:56,296 INFO L462 AbstractCegarLoop]: Abstraction has 49521 states and 79925 transitions. [2019-11-15 21:53:56,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 49521 states and 79925 transitions. [2019-11-15 21:53:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-15 21:53:56,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:56,332 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-15 21:53:56,333 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1051118833, now seen corresponding path program 1 times [2019-11-15 21:53:56,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:56,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945855670] [2019-11-15 21:53:56,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:56,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:56,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 3026 trivial. 0 not checked. [2019-11-15 21:53:56,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945855670] [2019-11-15 21:53:56,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:56,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:53:56,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565441715] [2019-11-15 21:53:56,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:53:56,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:53:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:53:56,709 INFO L87 Difference]: Start difference. First operand 49521 states and 79925 transitions. Second operand 4 states. [2019-11-15 21:53:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:58,798 INFO L93 Difference]: Finished difference Result 81536 states and 130992 transitions. [2019-11-15 21:53:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:53:58,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 657 [2019-11-15 21:53:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:58,842 INFO L225 Difference]: With dead ends: 81536 [2019-11-15 21:53:58,842 INFO L226 Difference]: Without dead ends: 53193 [2019-11-15 21:53:58,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:53:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53193 states. [2019-11-15 21:53:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53193 to 49575. [2019-11-15 21:53:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49575 states. [2019-11-15 21:53:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49575 states to 49575 states and 79967 transitions. [2019-11-15 21:53:59,952 INFO L78 Accepts]: Start accepts. Automaton has 49575 states and 79967 transitions. Word has length 657 [2019-11-15 21:53:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:59,952 INFO L462 AbstractCegarLoop]: Abstraction has 49575 states and 79967 transitions. [2019-11-15 21:53:59,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:53:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 49575 states and 79967 transitions. [2019-11-15 21:53:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2019-11-15 21:53:59,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:59,983 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-15 21:53:59,984 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:59,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1277805033, now seen corresponding path program 1 times [2019-11-15 21:53:59,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:59,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362895406] [2019-11-15 21:53:59,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:59,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:59,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4075 backedges. 1743 proven. 0 refuted. 0 times theorem prover too weak. 2332 trivial. 0 not checked. [2019-11-15 21:54:00,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362895406] [2019-11-15 21:54:00,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:00,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:00,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806064868] [2019-11-15 21:54:00,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:00,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:00,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:00,409 INFO L87 Difference]: Start difference. First operand 49575 states and 79967 transitions. Second operand 5 states. [2019-11-15 21:54:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:02,369 INFO L93 Difference]: Finished difference Result 110865 states and 177695 transitions. [2019-11-15 21:54:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:02,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 659 [2019-11-15 21:54:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:02,425 INFO L225 Difference]: With dead ends: 110865 [2019-11-15 21:54:02,425 INFO L226 Difference]: Without dead ends: 61309 [2019-11-15 21:54:02,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61309 states. [2019-11-15 21:54:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61309 to 54126. [2019-11-15 21:54:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54126 states. [2019-11-15 21:54:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54126 states to 54126 states and 87559 transitions. [2019-11-15 21:54:04,390 INFO L78 Accepts]: Start accepts. Automaton has 54126 states and 87559 transitions. Word has length 659 [2019-11-15 21:54:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:04,390 INFO L462 AbstractCegarLoop]: Abstraction has 54126 states and 87559 transitions. [2019-11-15 21:54:04,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 54126 states and 87559 transitions. [2019-11-15 21:54:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-11-15 21:54:04,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:04,424 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-15 21:54:04,424 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1277003389, now seen corresponding path program 1 times [2019-11-15 21:54:04,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:04,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096686912] [2019-11-15 21:54:04,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:04,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:04,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 1755 proven. 0 refuted. 0 times theorem prover too weak. 2332 trivial. 0 not checked. [2019-11-15 21:54:04,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096686912] [2019-11-15 21:54:04,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:04,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:04,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057776253] [2019-11-15 21:54:04,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:04,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:04,871 INFO L87 Difference]: Start difference. First operand 54126 states and 87559 transitions. Second operand 5 states. [2019-11-15 21:54:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:06,826 INFO L93 Difference]: Finished difference Result 114084 states and 183007 transitions. [2019-11-15 21:54:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:06,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 660 [2019-11-15 21:54:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:06,878 INFO L225 Difference]: With dead ends: 114084 [2019-11-15 21:54:06,879 INFO L226 Difference]: Without dead ends: 59881 [2019-11-15 21:54:06,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59881 states. [2019-11-15 21:54:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59881 to 53934. [2019-11-15 21:54:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53934 states. [2019-11-15 21:54:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53934 states to 53934 states and 86841 transitions. [2019-11-15 21:54:09,020 INFO L78 Accepts]: Start accepts. Automaton has 53934 states and 86841 transitions. Word has length 660 [2019-11-15 21:54:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:09,020 INFO L462 AbstractCegarLoop]: Abstraction has 53934 states and 86841 transitions. [2019-11-15 21:54:09,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 53934 states and 86841 transitions. [2019-11-15 21:54:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-11-15 21:54:09,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:09,052 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:09,053 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1338264829, now seen corresponding path program 1 times [2019-11-15 21:54:09,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:09,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15286211] [2019-11-15 21:54:09,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:09,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:09,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4210 backedges. 1935 proven. 28 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2019-11-15 21:54:09,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15286211] [2019-11-15 21:54:09,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200933392] [2019-11-15 21:54:09,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:09,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 2100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:54:09,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:09,995 INFO L375 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 8 [2019-11-15 21:54:09,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:09,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:09,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:09,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:54:10,015 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_172|], 5=[|v_#memory_int_190|]} [2019-11-15 21:54:10,017 INFO L375 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 81 treesize of output 69 [2019-11-15 21:54:10,018 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:10,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:10,023 INFO L375 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 69 treesize of output 51 [2019-11-15 21:54:10,024 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:10,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:10,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:10,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-15 21:54:10,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:10,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:10,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:10,282 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:54:10,285 INFO L168 Benchmark]: Toolchain (without parser) took 98585.26 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 939.3 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,285 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:54:10,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.51 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,286 INFO L168 Benchmark]: Boogie Preprocessor took 99.95 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,286 INFO L168 Benchmark]: RCFGBuilder took 1375.60 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: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,287 INFO L168 Benchmark]: TraceAbstraction took 96221.01 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 21:54:10,288 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 782.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.51 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.95 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1375.60 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: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96221.01 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:54:12,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:54:12,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:54:12,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:54:12,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:54:12,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:54:12,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:54:12,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:54:12,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:54:12,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:54:12,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:54:12,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:54:12,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:54:12,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:54:12,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:54:12,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:54:12,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:54:12,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:54:12,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:54:12,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:54:12,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:54:12,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:54:12,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:54:12,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:54:12,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:54:12,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:54:12,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:54:12,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:54:12,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:54:12,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:54:12,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:54:12,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:54:12,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:54:12,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:54:12,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:54:12,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:54:12,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:54:12,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:54:12,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:54:12,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:54:12,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:54:12,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:54:12,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:54:12,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:54:12,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:54:12,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:54:12,594 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:54:12,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:54:12,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:54:12,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:54:12,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:54:12,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:54:12,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:54:12,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:54:12,598 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:54:12,598 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:54:12,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:54:12,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:54:12,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:54:12,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:54:12,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:54:12,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:54:12,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:54:12,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:54:12,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:54:12,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:54:12,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:54:12,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:54:12,602 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:54:12,602 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:54:12,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:54:12,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:54:12,602 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer 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 -> e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 [2019-11-15 21:54:12,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:54:12,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:54:12,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:54:12,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:54:12,650 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:54:12,651 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:54:12,699 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b95cfb456/1ee7f076393c460db9cc95d36a9c6eef/FLAG699493ace [2019-11-15 21:54:13,262 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:54:13,262 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:54:13,284 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b95cfb456/1ee7f076393c460db9cc95d36a9c6eef/FLAG699493ace [2019-11-15 21:54:13,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/data/b95cfb456/1ee7f076393c460db9cc95d36a9c6eef [2019-11-15 21:54:13,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:54:13,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:54:13,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:13,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:54:13,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:54:13,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:13" (1/1) ... [2019-11-15 21:54:13,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34da0011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:13, skipping insertion in model container [2019-11-15 21:54:13,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:13" (1/1) ... [2019-11-15 21:54:13,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:54:13,528 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:54:14,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:14,041 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:54:14,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:14,203 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:54:14,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14 WrapperNode [2019-11-15 21:54:14,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:14,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:54:14,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:54:14,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:54:14,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:54:14,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:54:14,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:54:14,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:54:14,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... [2019-11-15 21:54:14,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:54:14,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:54:14,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:54:14,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:54:14,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/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-11-15 21:54:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:54:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:54:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:54:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:54:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:54:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:54:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:54:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:54:14,827 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:54:17,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:54:17,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:54:17,971 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:54:17,972 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:54:17,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:17 BoogieIcfgContainer [2019-11-15 21:54:17,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:54:17,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:54:17,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:54:17,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:54:17,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:54:13" (1/3) ... [2019-11-15 21:54:17,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d9797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:54:17, skipping insertion in model container [2019-11-15 21:54:17,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:14" (2/3) ... [2019-11-15 21:54:17,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d9797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:54:17, skipping insertion in model container [2019-11-15 21:54:17,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:17" (3/3) ... [2019-11-15 21:54:17,980 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2019-11-15 21:54:17,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:54:17,993 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:54:18,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:54:18,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:54:18,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:54:18,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:54:18,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:54:18,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:54:18,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:54:18,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:54:18,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:54:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 21:54:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:54:18,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:18,053 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:18,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1923572963, now seen corresponding path program 1 times [2019-11-15 21:54:18,066 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:18,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1385399863] [2019-11-15 21:54:18,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:18,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:18,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:18,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:18,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1385399863] [2019-11-15 21:54:18,362 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:18,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:54:18,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857620565] [2019-11-15 21:54:18,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:18,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:18,382 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-15 21:54:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:18,617 INFO L93 Difference]: Finished difference Result 576 states and 989 transitions. [2019-11-15 21:54:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:18,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-15 21:54:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:18,634 INFO L225 Difference]: With dead ends: 576 [2019-11-15 21:54:18,635 INFO L226 Difference]: Without dead ends: 393 [2019-11-15 21:54:18,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-15 21:54:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-11-15 21:54:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-15 21:54:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 601 transitions. [2019-11-15 21:54:18,717 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 601 transitions. Word has length 44 [2019-11-15 21:54:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:18,717 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 601 transitions. [2019-11-15 21:54:18,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 601 transitions. [2019-11-15 21:54:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:54:18,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:18,729 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-15 21:54:18,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:18,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1030792906, now seen corresponding path program 1 times [2019-11-15 21:54:18,933 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:18,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [649935147] [2019-11-15 21:54:18,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:19,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:19,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:19,211 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:19,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649935147] [2019-11-15 21:54:19,252 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:19,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:54:19,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052630732] [2019-11-15 21:54:19,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:19,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:19,256 INFO L87 Difference]: Start difference. First operand 393 states and 601 transitions. Second operand 4 states. [2019-11-15 21:54:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:21,471 INFO L93 Difference]: Finished difference Result 902 states and 1399 transitions. [2019-11-15 21:54:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:21,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 21:54:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:21,476 INFO L225 Difference]: With dead ends: 902 [2019-11-15 21:54:21,476 INFO L226 Difference]: Without dead ends: 645 [2019-11-15 21:54:21,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-11-15 21:54:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-11-15 21:54:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-15 21:54:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 982 transitions. [2019-11-15 21:54:21,548 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 982 transitions. Word has length 107 [2019-11-15 21:54:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:21,549 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 982 transitions. [2019-11-15 21:54:21,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 982 transitions. [2019-11-15 21:54:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:54:21,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:21,552 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:21,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:21,754 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash -488998158, now seen corresponding path program 1 times [2019-11-15 21:54:21,755 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:21,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1152687490] [2019-11-15 21:54:21,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:22,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:22,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:54:22,091 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:54:22,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1152687490] [2019-11-15 21:54:22,146 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:22,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:54:22,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565602997] [2019-11-15 21:54:22,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:54:22,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:22,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:54:22,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:54:22,148 INFO L87 Difference]: Start difference. First operand 645 states and 982 transitions. Second operand 3 states. [2019-11-15 21:54:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:24,305 INFO L93 Difference]: Finished difference Result 1278 states and 1958 transitions. [2019-11-15 21:54:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:54:24,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-15 21:54:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:24,311 INFO L225 Difference]: With dead ends: 1278 [2019-11-15 21:54:24,311 INFO L226 Difference]: Without dead ends: 769 [2019-11-15 21:54:24,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 343 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-11-15 21:54:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-11-15 21:54:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2019-11-15 21:54:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-15 21:54:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1166 transitions. [2019-11-15 21:54:24,349 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1166 transitions. Word has length 173 [2019-11-15 21:54:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:24,351 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1166 transitions. [2019-11-15 21:54:24,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:54:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1166 transitions. [2019-11-15 21:54:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 21:54:24,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:24,357 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:54:24,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:24,560 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -142799614, now seen corresponding path program 1 times [2019-11-15 21:54:24,561 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:24,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1453788131] [2019-11-15 21:54:24,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:24,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:24,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:54:24,920 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:54:24,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453788131] [2019-11-15 21:54:24,977 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:24,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:54:24,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697008717] [2019-11-15 21:54:24,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:24,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:24,980 INFO L87 Difference]: Start difference. First operand 769 states and 1166 transitions. Second operand 4 states. [2019-11-15 21:54:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:25,412 INFO L93 Difference]: Finished difference Result 1652 states and 2524 transitions. [2019-11-15 21:54:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:25,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 21:54:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:25,419 INFO L225 Difference]: With dead ends: 1652 [2019-11-15 21:54:25,419 INFO L226 Difference]: Without dead ends: 1019 [2019-11-15 21:54:25,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-15 21:54:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-11-15 21:54:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-15 21:54:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1544 transitions. [2019-11-15 21:54:25,468 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1544 transitions. Word has length 214 [2019-11-15 21:54:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:25,469 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1544 transitions. [2019-11-15 21:54:25,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1544 transitions. [2019-11-15 21:54:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-15 21:54:25,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:25,475 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-15 21:54:25,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:25,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1706576766, now seen corresponding path program 1 times [2019-11-15 21:54:25,679 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:25,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [683291787] [2019-11-15 21:54:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:25,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 21:54:26,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 21:54:26,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [683291787] [2019-11-15 21:54:26,124 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:26,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:54:26,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295035005] [2019-11-15 21:54:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:54:26,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:54:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:54:26,126 INFO L87 Difference]: Start difference. First operand 1019 states and 1544 transitions. Second operand 3 states. [2019-11-15 21:54:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:26,978 INFO L93 Difference]: Finished difference Result 2025 states and 3080 transitions. [2019-11-15 21:54:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:54:26,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-15 21:54:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:26,984 INFO L225 Difference]: With dead ends: 2025 [2019-11-15 21:54:26,984 INFO L226 Difference]: Without dead ends: 1142 [2019-11-15 21:54:26,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 593 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-11-15 21:54:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-15 21:54:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2019-11-15 21:54:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-11-15 21:54:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1726 transitions. [2019-11-15 21:54:27,027 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1726 transitions. Word has length 298 [2019-11-15 21:54:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:27,027 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 1726 transitions. [2019-11-15 21:54:27,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:54:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1726 transitions. [2019-11-15 21:54:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-15 21:54:27,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:27,034 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 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] [2019-11-15 21:54:27,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:27,237 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2071774241, now seen corresponding path program 1 times [2019-11-15 21:54:27,238 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:27,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [54642041] [2019-11-15 21:54:27,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:27,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:27,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 21:54:27,764 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 21:54:27,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [54642041] [2019-11-15 21:54:27,846 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:27,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:54:27,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545574846] [2019-11-15 21:54:27,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:27,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:27,848 INFO L87 Difference]: Start difference. First operand 1142 states and 1726 transitions. Second operand 4 states. [2019-11-15 21:54:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:28,963 INFO L93 Difference]: Finished difference Result 2398 states and 3643 transitions. [2019-11-15 21:54:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:28,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-11-15 21:54:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:28,972 INFO L225 Difference]: With dead ends: 2398 [2019-11-15 21:54:28,972 INFO L226 Difference]: Without dead ends: 1392 [2019-11-15 21:54:28,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-11-15 21:54:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2019-11-15 21:54:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-11-15 21:54:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2102 transitions. [2019-11-15 21:54:29,026 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2102 transitions. Word has length 337 [2019-11-15 21:54:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:29,027 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 2102 transitions. [2019-11-15 21:54:29,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2102 transitions. [2019-11-15 21:54:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-15 21:54:29,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:29,037 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:54:29,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:29,240 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1726301007, now seen corresponding path program 1 times [2019-11-15 21:54:29,242 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:29,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [255310440] [2019-11-15 21:54:29,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:29,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:29,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-11-15 21:54:29,852 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-11-15 21:54:29,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255310440] [2019-11-15 21:54:29,968 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:29,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:54:29,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144818419] [2019-11-15 21:54:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:54:29,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:54:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:54:29,970 INFO L87 Difference]: Start difference. First operand 1392 states and 2102 transitions. Second operand 3 states. [2019-11-15 21:54:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:30,421 INFO L93 Difference]: Finished difference Result 2772 states and 4197 transitions. [2019-11-15 21:54:30,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:54:30,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-11-15 21:54:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:30,430 INFO L225 Difference]: With dead ends: 2772 [2019-11-15 21:54:30,430 INFO L226 Difference]: Without dead ends: 1516 [2019-11-15 21:54:30,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 845 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-11-15 21:54:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-11-15 21:54:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2019-11-15 21:54:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-15 21:54:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2285 transitions. [2019-11-15 21:54:30,488 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2285 transitions. Word has length 424 [2019-11-15 21:54:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:30,489 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2285 transitions. [2019-11-15 21:54:30,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:54:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2285 transitions. [2019-11-15 21:54:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-11-15 21:54:30,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:30,503 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1] [2019-11-15 21:54:30,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:30,707 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1651587245, now seen corresponding path program 1 times [2019-11-15 21:54:30,709 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:30,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1210965761] [2019-11-15 21:54:30,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:31,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:54:31,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2019-11-15 21:54:31,381 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:54:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2019-11-15 21:54:31,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1210965761] [2019-11-15 21:54:31,532 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:31,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:54:31,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926088983] [2019-11-15 21:54:31,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:31,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:54:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:31,535 INFO L87 Difference]: Start difference. First operand 1516 states and 2285 transitions. Second operand 4 states. [2019-11-15 21:54:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:32,200 INFO L93 Difference]: Finished difference Result 3145 states and 4758 transitions. [2019-11-15 21:54:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:32,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 468 [2019-11-15 21:54:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:32,213 INFO L225 Difference]: With dead ends: 3145 [2019-11-15 21:54:32,213 INFO L226 Difference]: Without dead ends: 1765 [2019-11-15 21:54:32,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-15 21:54:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-11-15 21:54:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-15 21:54:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2657 transitions. [2019-11-15 21:54:32,322 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2657 transitions. Word has length 468 [2019-11-15 21:54:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:32,322 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2657 transitions. [2019-11-15 21:54:32,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2657 transitions. [2019-11-15 21:54:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-15 21:54:32,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:32,329 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:54:32,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:32,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:54:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 381854906, now seen corresponding path program 1 times [2019-11-15 21:54:32,535 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:32,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2142774426] [2019-11-15 21:54:32,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60b4bd3e-bede-4dbe-82aa-72f6ed1ca624/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:36,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 21:54:36,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:37,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:37,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 31 [2019-11-15 21:54:37,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:37,873 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 21:54:37,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:37,876 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_224|], 2=[|v_#memory_$Pointer$.base_221|, |v_#memory_$Pointer$.base_220|]} [2019-11-15 21:54:37,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:37,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:37,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:37,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:37,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:37,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:54:38,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,210 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:54:38,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:54:38,257 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:54:38,350 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,392 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-15 21:54:38,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,446 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:54:38,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:54:38,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:54:38,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:54:38,531 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_222|], 12=[|v_#memory_$Pointer$.base_227|]} [2019-11-15 21:54:38,537 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:38,661 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 21:54:38,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:54:38,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 21:54:38,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:54:38,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:54:38,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:54:38,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:38,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:54:38,822 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_220|], 20=[|v_#memory_$Pointer$.base_230|]} [2019-11-15 21:54:38,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 49 treesize of output 37 [2019-11-15 21:54:38,830 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:38,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:38,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:39,473 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-15 21:54:39,474 INFO L341 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-15 21:54:39,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 21:54:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:39,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:39,902 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 21:54:40,171 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-11-15 21:54:40,171 INFO L567 ElimStorePlain]: treesize reduction 364, result has 30.0 percent of original size [2019-11-15 21:54:40,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:40,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:186 [2019-11-15 21:54:40,301 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_223|], 30=[|v_#memory_$Pointer$.base_231|]} [2019-11-15 21:54:40,313 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:40,487 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:54:40,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:40,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:40,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:55:13,742 WARN L191 SmtUtils]: Spent 33.24 s on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-15 21:55:13,742 INFO L341 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-15 21:55:13,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-15 21:55:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:55:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:55:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:13,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:26,597 WARN L191 SmtUtils]: Spent 1.21 m on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2019-11-15 21:56:26,597 INFO L567 ElimStorePlain]: treesize reduction 2547, result has 3.5 percent of original size [2019-11-15 21:56:26,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:26,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-15 21:56:26,675 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_240|], 30=[|v_#memory_$Pointer$.base_232|]} [2019-11-15 21:56:26,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:56:26,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:26,829 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 21:56:26,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:26,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:26,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:26,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:26,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:26,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:26,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:43,503 WARN L191 SmtUtils]: Spent 16.66 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 21:56:43,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:43,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-15 21:56:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:43,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:43,864 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 42 [2019-11-15 21:56:43,864 INFO L567 ElimStorePlain]: treesize reduction 1122, result has 7.6 percent of original size [2019-11-15 21:56:43,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:43,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-15 21:56:43,945 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_221|], 2=[|v_#memory_int_241|], 20=[|v_#memory_$Pointer$.base_233|]} [2019-11-15 21:56:43,967 INFO L375 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 25 [2019-11-15 21:56:43,967 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:44,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:44,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 21:56:44,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:44,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:44,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:44,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:44,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:44,358 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 21:56:44,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:44,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-15 21:56:44,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:44,419 INFO L496 ElimStorePlain]: Start of recursive call 4: 17 dim-0 vars, End of recursive call: 20 dim-0 vars, and 9 xjuncts. [2019-11-15 21:56:45,561 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 236 DAG size of output: 131 [2019-11-15 21:56:45,562 INFO L567 ElimStorePlain]: treesize reduction 484, result has 31.3 percent of original size [2019-11-15 21:56:45,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 18 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:45,566 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:140 [2019-11-15 21:56:45,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:45,673 INFO L375 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 32 treesize of output 34 [2019-11-15 21:56:45,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:45,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:45,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:45,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-15 21:56:45,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 21:56:45,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:45,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:45,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:45,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 21:56:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1294 proven. 96 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-11-15 21:56:46,665 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:56:46,762 INFO L375 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 32 [2019-11-15 21:56:46,762 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:46,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:46,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:46,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 21:56:46,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:46,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:47,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:56:47,040 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:56:47,044 INFO L168 Benchmark]: Toolchain (without parser) took 153610.18 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 649.1 MB). Free memory was 946.8 MB in the beginning and 1.4 GB in the end (delta: -415.0 MB). Peak memory consumption was 234.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,045 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:47,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.47 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,046 INFO L168 Benchmark]: Boogie Preprocessor took 171.94 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,046 INFO L168 Benchmark]: RCFGBuilder took 3505.80 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: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,047 INFO L168 Benchmark]: TraceAbstraction took 149069.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 490.7 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -345.2 MB). Peak memory consumption was 145.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:47,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 765.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.47 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.94 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3505.80 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: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149069.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 490.7 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -345.2 MB). Peak memory consumption was 145.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...